6. (U: 20pts, G: 20pts) For the following linear programming problem max 231 + 3332 subject to: $1 + 232 g 1 5191 + 5192 S 3 331,32 20 o a. 3pts. Draw the polygon of the feasible set for this problem and provide the coordinates of every vertex. You can draw by hand or by computer. 0 b. 4pts. Introduce slack variables to transform the inequalities to equality constraints and nd a feasible start to this problem. 0 c. 10pts. Write the simplex tableau and solve using the simplex method. Show your step by step methodology or you will get zero . d. 3pts. Draw the path of your simplex iterations along the vertices of the polynomial in part a