Represent the linear programming problem below by an initial Simplex tableau.
$$\begin{array} { l l }
\text { Maximise } & P = 5 x - 4 y - 3 z ,
\text { subject to } & 2 x - 3 y + 4 z \leqslant 10 ,
& 6 x + 5 y + 4 z \leqslant 60 ,
\text { and } & x \geqslant 0 , y \geqslant 0 , z \geqslant 0 .
\end{array}$$
Perform one iteration of the Simplex algorithm and write down the values of \(x , y , z\) and \(P\) that result from this iteration.