Solve the following linear programming problem grafically
maximize Z= 3x1 + 4x2
subject to 2x1 + 5x2 ≤ 8
3x1 + 2x2 < 14
X1 ≤ 6 X1,
X2 ≥ 0
a). Solve the model graphically
b). Indicate how much slack resource is available at the optimal solution point
c). Determine the sensitivity range for objective function X₁ coefficient (c₁)