3. A two-person zero-sum game is represented by the following pay-off matrix for player A.
| B plays 1 | B plays 2 | B plays 3 |
| A plays 1 | - 5 | 6 | - 3 |
| A plays 2 | 1 | - 4 | 13 |
| A plays 3 | - 2 | 3 | - 1 |
- Verify that there is no stable solution to this game.
- Reduce the game so that player B has a choice of only two actions.
- Write down the reduced pay-off matrix for player B.
- Find the best strategy for player B and the value of the game to player B.