Problem $7-21$ For the linear program: Max $2$A $+3$B s$.$t$.5$A $+5$B $<=400-1$A $+1$B $<=101$A $+3$B $>=90$ A$,$ B $>=0$ Select the constraint represented by each constraint line $(1,2,$ or $3).$ Constraint $1=-1$A $+1$B $<=105$A $+5$B $<=4001$A $+3$B $<=90$ Constraint $2=-1$A $+1$B $<=101$A $+3$B $<=905$A $+5$B $<=400$ Constraint $3=-1$A $+1$B $<=105$A $+5$B $<=4001$A $+3$B $>=90$ Select the correct graph that shows the optimal solution for the problem. $1234$ Graph $($i$)$Graph $($ii$)$Graph $($iii$)$Graph $($iv$)$ Identify the optimal extreme point. What is the optimal solution? Optimal solution is A $=$ fill in the blank $5,$ B $=$ fill in the blank $6,$ Max $=$ fill in the blank $7$ Which constraints are binding? Constraint $1=$ BindingNon$-$binding Constraint $2=$ Binding Non$-$binding Constraint $3=$ Binding Non$-$binding How much slack or surplus is associated with the nonbinding constraint?