Use the simplex method to solve the linear programming problem. Maximize z=3x
1+2x 2 +x 3 subject to 2x 1+6x 2+x 3≤10x 1 +4x2+5x 3≤17x1 ≥0,x 2 ≥0,x 3≥0​ Select the correct choice below and, ifnecessary, fill in the answer boxes to complete your choice.
A. The maximum is when x 1=, x 2=, x 3=, s 1=, and s 2=
B. There is no maximum.