Interpreting Graph of a Linear Program. Consider the linear program below and answer the following questions. LO $3,4,6$

Max $2$A$+3$B

S$.$t$.$

$5$a $+5$b $400$ Constraint $1$

$-1$a $+1$b $10$ Constraint $2$

$1$a $+3$b $90$ Constraint $3$

A$,$B $0$

$1.$ Place a number $(1,2,3)$ next to each constraint line to identify which constraint it represents.

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

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

$4.$ Which constraints are binding? Explain.

$5.$ How much slack or surplus is associated with the nonbinding constraint?