Consider the following linear program and answer the following questions.

Max $2A+3B,$

$s.t.$

$,$

$5A+5B400$ Constraint $1$

$-1A+1B10$ Constraint $2$

$1A+3B90$ Constraint $3$

$A,B0,$

TGraph of the constraint lines. Shade the feasible region. Whats the optimal extreme point? OPtimasl solution? Which constraints are binding? EXPLAIN$/$ How much slack or surplus is associated with the nonbinding constraint?