Solve the linear programming problem using the simplex method. Maximize P=30x₁ +40x2 subject to 2X₁ + X₂ ≤80 X₁ + X₂ 556 X₁ + 2x₂ ≤96 X1 X₂20 Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice OA. The maximum value of P is when X₁ and X₂ OB. There is no optimal solution. 4