4. Andrew ( \(A\) ) and Barbara ( \(B\) ) play a zero-sum game. This game is represented by the following payoff matrix for Andrew.
$$A \left( \begin{array} { c c c }
& B &
3 & 5 & 4
1 & 4 & 2
6 & 3 & 7
\end{array} \right)$$
- Explain why this matrix may be reduced to
$$\left( \begin{array} { l l }
3 & 5
6 & 3
\end{array} \right) .$$ - Hence find the best strategy for each player and the value of the game.