Consider the following linear programme: Max 3x1 + 2x2 s.t. 1x1 + 1x2 10 3x1 + 1x2 24 1x1 + 2x2 16 x1, x2 0 a) Find the optimal solution using the graphical solution procedure. b) If the objective function coefficient for x1 changes from 3 to 6, what will happen to the optimal solution? Use the graphical solution procedure to explain whatever changes (if any) applied to the optimal solution. c) With the assumption that the objective function coefficient for x1 remains 3, and the objective function coefficient for x2 changes from 2 to 4, what will happen to the optimal solution? Similarly, use the graphical solution procedure to explain whatever changes (if any) applied to the optimal solution.