(Solved): Solve the linear programming problem using the simplex method. Maximize z=2x1+3x2 subject to ...

Solve the linear programming problem using the simplex method. Maximize $z=2x_1+3x_2$ subject to $\begin{array}{l}5x_1+x_2?40\\ 3x_1+2x_2?60\\ x_1+x_2?50\\ x_1,x_2?0\end{array}$ Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The maximum is $z=$ when $x_1=,{\mathrm{x}}_2=,{\mathrm{s}}_1=,{\mathrm{s}}_2=$, and ${\mathrm{s}}_3=$. B. There is no maximum solution for this linear programming problem.