Chapter 4.2, Problem 1CYU

Which of these simplex tableaux has a solution that corresponds to a maximum for the associated linear programming problem?

(a) $\begin{array}{l}\begin{array}{ccccc}x& y& u& v& M\end{array}\\ \left[\begin{array}{cccccc}3& 1& 0& 1& 0& 5\\ 2& 0& 0& 0& 1& 0\\ -1& -2& 1& 0& 0& 3\end{array}\right]\end{array}$

(b) $\begin{array}{l}\begin{array}{ccccc}x& y& u& v& M\end{array}\\ \left[\begin{array}{cccccc}2& 1& 0& 11& 0& 10\\ 1& 0& 1& 7& 0& 1\\ 1& 0& 0& 4& 1& -2\end{array}\right]\end{array}$