Solve the linear programming problem using the simplex method.
Maximize P=2x_(1) 3x_(2)
subject to -2x_(1) x_(2)<=16
,-x_(1) x_(2)<=40
,x_(2)<=48
,x_(1),x_(2)>=0Use the simplex method to solve the problem. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum value of
Pis
?when
x_(1)=
?and
x_(2)=
?
?B. There is no optimal solution.