The A-B-C department of a large company makes three products (A, B and C). To determine the best production schedule, the manager has formulated the following linear programming model: Decision variables: A = quantity of product A B = quantity of product B C = quantity of product C Objective function: Maximize 12 A + 15 B + 16 C (total profit: coefficients are net profit per unit in dollars) Constraints: Material. 1 3 A + ** B + 8 C = 0 The manager has solved this problem using Excel Solver and the sensitivity report is given below: Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease SB$2 A 16 12 0.5 $C$2 B 0 -1 15 1 1E+30 $D$2 C 84 0 16 2 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $E$6 Material 1 720 0.8 720 80 420 SE$7 Material 2 284 600 1E+30 316 $E$8 Material 3 400 2.4 400 560 40 Based on the information given (No need to implement this problem into solver), if product C's unit profit increases to 17, what is the optimal production quantity of product C? O 84 400 0 2 O Can't be computed with the given information