Consider the following linear program. 3A + 3B Min s.t. 1A + 3B S 10 3A + 1B 2 13 1A - 1B = 3 AB 20 (a) Show the feasible region, B B B 3.0 3.0 3.0: 2.5 2.5 2.5 2.0 2.0 2.0: 1.5 1.5) 1.5 1.0 1.0 1.0 0.5 0.5 0.5H A 1 2 3 4 5 1 2 13 4 5 1 2 3 4 5 G B 3.0 2.5 2.0 1.5 1.0 0.5 1 2 3 4 5 (b) What are the extreme points of the feasible region? smaller A-value (A, B) = larger A-value (A, B) = (c) Find the optimal solution using the graphical solution procedure. (A, B) =