Consider the following linear program:
Minimize Subject to:
z = 2x₁ + 3x₂
2X₁ - X₂ - X3 ≥ 3,
x₁ - x₂ + x3 ≥ 2,
X1, X₂ ≥ 0.

(a) Solve the above linear program using the primal simplex method.
(b) Solve the above linear program using the dual simplex method.
(c) Use duality theory and your answer to parts (a) and (b) to find an optimal solution of the dual linear program. DO NOT solve the dual problem directly!