Consider the following linear program and answer the following questions. Max2A+38s.t5A+5390Constraint11A+1B10Constraint21A+3890Constraint3A,B0 The figure shows a graph of the constraint lines. (a) Place a number (1,2, or 3) next to each constraint line to identify which constraint it represents. Select the correct graph. (b) Shade in the feasible region. Select the correct graph. (c) Identify the optimal extreme point. What is the optimal solution? (A,B)=( (d) Which constraints are binding? Fxplain. The optimal solution occurs ot the intersection of constraints so these are the binding constraints. (e) How much slack or surplus is associated with the nonbinding constraint? Constraint is the nanbinding comstraint. There is a associated with this constraint