The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem.

x $1$

x $2$

x $3$

s $1$

s $2$

z

$1$

$4$

$5$

$1$

$0$

$0$

$12$

$3$

$4$

$1$

$0$

$1$

$0$

$33$

minus$5$

minus$3$

minus$1$

$0$

$0$

$1$

$0$

Question content area bottom

Part $1$

The maximum is

$$

enter your response here when x $1$equals

$$

enter your response here$,$ x $2$equals

$$

enter your response here$,$ x $3$equals

$$

enter your response here$,$ s $1$equals

$$

enter your response here$,$ and s $2$equals

$$

enter your response here.