Consider the following linear program:

Max $2A+3B$

$5A+5B400$ Constraint $1$

$-1A+1B10$ Constradut $2$

$1A+3B90$ Constraint $3$

$A,B0$

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.

b$.$ Shade in the feasible region on the graph.

c$.$ Identify the optimal extreme point. What is the optimal solution?

d$.$ Which constraints are binding? Explain.

e: How much slack or surplus is associated with the nombinding constraint?