5 The number of points won by player 1 in a zero-sum game is shown in the pay-off matrix below, where \(k\) is a constant.
\begin{table}[h]
\captionsetup{labelformat=empty}
\caption{Player 2}
| Strategy E | Strategy F | Strategy G | Strategy H |
| Strategy A | \(2 k\) | -2 | \(1 - k\) | 4 |
| Strategy B | -3 | 3 | 4 | -5 |
| Strategy C | 1 | 4 | -4 | 2 |
| Strategy D | 4 | -2 | -5 | 6 |
\end{table}
- In one game, player 2 chooses strategy H.
Write down the greatest number of points that player 2 could win.
You are given that strategy A is a play-safe strategy for player 1.
- Determine the range of possible values for \(k\).
- Determine the column minimax value.