Display the following linear programming problem in a Simplex tableau.
$$\begin{array} { l c }
\text { Maximise } & P = 3 x + 6 y + 2 z
\text { subject to } & x + 3 y + 2 z \leqslant 11
& 3 x + 4 y + 2 z \leqslant 21
\text { and } & x \geqslant 0 , y \geqslant 0 , z \geqslant 0 .
\end{array}$$
The first pivot to be chosen is from the \(y\)-column.
Perform one iteration of the Simplex method.
Perform one further iteration.
Interpret the tableau obtained in part (c) and state the values of your slack variables.