8. Solve the linear programming problem. Minimize z = 10x₁ + 16x₂ + 20x3, subject to 3x₁ + x₂ + 6x² ≥ 9 x₁ + x₂ ≥ 9 4x₂ + x₂ ≥ 12 x₁ ≥ 0, x₂ ≥ 0, x² ≥ 0 by applying t