max Questions #6 to #9 are based on using the Simplex Algorithm to solve the following Linear Programming problem: z = 8x2 - 2x2 s.t. 3x1 + x2 56 -*1 + 2x, So *1,*220 6. Which variable is entering? a. No entering variable b. X1 c. X2 d. X3 e. X4 f. Xor X, g. Xor X3 h. None of the above Page 5 of 8 7. Which variable is leaving? a. No leaving variable (unbounded) b. X1 c. X2 d. X3 f. x, or X2 g. Xor x4 h. None of the above 8. What is the optimal solution for (x1,x2)? a. (2,0) b. (0,4) c. (3,1) d. (0,2) e. No optimal solution (unbounded) f. There are infinite number of solutions and (0, -8) is one of them. g. Infeasible h. None of the above 9. What is the optimal objective z value? a. 0 b. 4 c. 2 d. 3 e. -8 f. 16 g. 22 h. None of the above