Consider the following linear programming problem:

Max 3A + 3B
s.t.
2A + 4B ≤ 12
6A + 4B ≤ 24
A, B ≥ 0
a. Find the optimal solution using the graphical solution procedure.
b. If the objective function is changed to 2A + 6B, what will the optimal solution be?
c. How many extreme points are there? What are the values of A and B at each extreme point?