1. Given this linear programming (LP) model:
Objective function: Maximize 10x₁ + x₂
Constraints:
3x₁ + x₂ ≤ 12
2x₁ + 2x₂ ≤ 16
x₁ - x₂ ≤ 2
x₁, x₂ ≥ 0
a. Graph the model.
b. Find the optimal point on the graph using the objective function method.
c. Use simultaneous equations to determine the optimal values of x₁ and x₂.
d. Determine the amount of slack for each constraint.