Problem 4. (25 points) a) (18 points) Use the Simplex method to solve the following problem: Max Z=x + 2x2 + 3x) to 2x1 + x2 + x3 s 20 x1 + 2x2 - X3 s 20 3x2 + x3 s 10 X1, X2, X3 20 Clearly specify the optimal values of all variables used in your procedure as well as the optimal value of the objective function. b) (7 points) In part a), say what comer point was analyzed in each iteration and give the corresponding value of the objective function. Include iteration 0, that is, the one that gives the starting comer point