questions 16 and 17 reference the following linear programming formulation and graphical solution Maximize Z = 3X1 + 2X2 Subject to (1) 4X1 3X2 (2) 2X1 24 + S X2 10 All decision variables 2 0 (0,8) (3,4) - Optimal (0,0) (5,0) 16. What is the shadow price for constraint #2? 17. What is the range of the objective function a. 0.50 coefficient for X1 that keeps the optimum solution? b. 0 a. 2.67 to 4.00 C . -0.50 b. -0 to 4.00 d. The shadow price cannot be determined c. 2.67 to 3.33 e. None of the above d. The range cannot be determined e. None of the above -0.08X45 0