The following linear programming problem has been solved by LINDO. Use the output to answer the questions. (Scroll down to see all). LINEAR PROGRAMMING PROBLEM MIN 39X1+48X2+21X3 S.T. C.1) 5X1 + 5X2 + 9X3 > 200 C.2) 11X1 + 14X2 + 5X3 > 500 END LP OPTIMUM FOUND AT STEP 1 OBJECTIVE FUNCTION VALUE 1) 1725.743 VARIABLE X1 X2 X3 VALUE 0.0000 34.653 2.9703 REDUCED COST 0.7129 0.0000 0.0000 ROW SLACK OR SURPLUS DUAL PRICES C.1) 0.0000 -0.5347 C.2) 0.0000 -3.2376 NO. ITERATIONS 1 NO. ITERATIONS- 1 RANGES IN WHICH THE BASIS IS UNCHANGED: VARIABLE X1 OBJ COEFFICIENT RANGES CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE 39.0000 INFINITY 0.7129 48.0000 0.9730 36.3333 21.0000 4.8000 3.8571 X2 X3 ROW RIGHTHAND SIDE RANGES CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE 200.0000 700.0000 21.4286 500.0000 60.0000 388.8889 C.1 C.2. a. Which constraints are binding at the optimal solution? (5 points) b. What is the dual price for the first constraint? What interpretation does it have? (5 points) c. By how much can the amount of resource constraint #2 decrease before the dual price will change? (5 points)