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$

s $3$

z

$2$

$2$

$9$

$1$

$0$

$0$

$0$

$48$

$4$

negative $5$

$6$

$0$

$1$

$0$

$0$

$60$

$2$

negative $2$

$6$

$0$

$0$

$1$

$0$

$16$

negative $14$

negative $10$

negative $12$

$0$

$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$,$ s $2$equals

$$

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

$$

enter your response here.

$($Type integers or simplified$$ fractions.$)$