Use the Simplex Method to Maximize $p = 2 x + y + 3 z + w + 2 v$

Short Answer

Use the simplex method to maximize $p = 2 x + y + 3 z + w + 2 v$ subject to the following.
​ $$\begin{array} { l } x + y \leq 3 \\y + z \leq 1 \\z + w \leq 3 \\w + v \leq 6\end{array}$$ $$x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0 , v \geq 0$$ ​ $p =$ __________
​ $x =$ __________
​ $y =$ __________
​ $z =$ __________
​ $w ^ { \prime } =$ __________
​ $v =$ __________