min z = x_(1) +2x_(2 )-3x_(3) such that x_(1)+x_(2)<=4 -x_(1)+x_(3)<= 1 x_(i)>=0 where i = 1,2 ,3 (a) graph the feasible region of the above problem and graph the feasible region of max(-f(x))/(m)ax[-f(x)]max[-f(x)] in a separate graph. Compare them. (5 points) (b) Use the Simplex algorithm to solve the equivalent maximization problem, max(-f(x))/(m)ax[-f(x)]max[-f(x)], showing all of your steps in a Simplex table. Compare your answer to what we got in class. (10 points)