Question # 5(26p): Suppose we have the following simplex tableau. Answer the following questions: G 10 -M 0 Basic Variables x1 A $2 Zj Gj-Zj Quantity 5 4 15 -4M + 50 10 1 0 0 10 0 10 5 x2 1/2 1 7/2 -M + 5 M 0 $1 -1/2 0 1/2 0 $2 0 0 1 -5 0 5 0 -M A 1 0 -M 0 a) Write the objective function. b) Carry out simplex precedure to solve this problem. In each iteration, determine pivot column, row and number. Give a reason and indicate if you have an optimal, a multiple optimal, an infeasible or an unbounded solution. c) Interpret your result.