Solve the linear programming problem using the simplex method. Maximize subject to P = 8x₁ + 2x₂-x3 x₁ + x2-x3 ≤2 2x₁ +4x2 + 3x3 ≤6 X1, X2. Хз 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. O A. The maximum value of P is when x₁ = , X₂=₁ and x3 = (Simplify your answers. Type integers or decimals rounded to the nearest tenth as needed.) OB. There is no optimal solution