Consider the following linear programming problem.

Min $4A+5B$

$s.t.$

$,1A+4B22$

$,2A+1B9$

$,3A+1\mathrm{.}5B24$

$,-2A+6B-2$

$,A,B0$

$($a$)$ Find the optimal solution using the graphical solution procedure and the value of the objective function.

$($b$)$ Determine the amount of slack or surplus for each constraint.

slack for $1A+4B22$

surplus for $2A+1B9$

slack for $3A+1\mathrm{.}5B24$

surplus for $-2A+6B-2$

$($c$)$ Suppose the objective function is changed to max $8A+3B.$ Find the optimal solution and the value of the objective function.

$at(A,B)=(,)$