Please solve this for me.

Consider the following linear programming problem. Min 2A + 3B s.t. 1A + 4B $ 21 2A + 1B27 3A + 1.5B S 21 -2A + 6820 A, B 20 (a) Find the optimal solution using the graphical solution procedure and the value of the objective function. at (A, B) = (b) Determine the amount of slack or surplus for each constraint. slack for 1A + 4B S 21 surplus for 2A + 1B 2 7 slack for 3A + 1.5B s 21 surplus for -2A + 6B 2 0 (c) Suppose the objective function is changed to max 5A + 2B. Find the optimal solution and the value of the objective function. at (A, B) =