Consider the following linear program, Max 24 + 38 St. 54 +58 5350 Constraint 1 -1A + 1B 10 Constraint 2 14 + 38 90 Constraint 3 ABD The figure shows a graph of the constraint lines. 100 OU 40 20 40 60 80 Too O (a) Place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents. Select the correct graph. R R B 100 100 100 100 (1) 80 80 (2) (3) 00 V 40 491 401 20 20 20 (1) 121 131 20 40 60 80 100 20 40 80 100 20 40 60 80 20 40 GO 80 Too (b) Shade in the feasible region. Select the correct graph. R B B 100 100 100 100 80 80 80 00 40 40 40 20 20 20 20 20 40 60 80 Too O 20 40 60 80 Too O 20 40 60 80 20 40 60 100 80 (c) Identify the optimal extreme point. What is the optimal solution? (A,B) - (d) Which constraints are binding? Explain The optimal solution occurs at the intersection of constraints C-Select- V so these are the binding constraints. (e) How much slack or surplus is associated with the nonbinding constraint? Constraint is the nonbinding constraint. There is a des associated with this constraint