Prove that every 2 × 2 game has a Nash equilibrium (in either pure or mixed strategies). Do this by considering the following general game and breaking the analysis into two categories:
(a) one of the pure-strategy profiles is a Nash equilibrium, and
(b) none of the pure-strategy profiles is a Nash equilibrium.
![2076_c808c001-4a3b-4cab-84c7-a5c24663bb6a.png](https://secure.tutorsglobe.com/CMSImages/2076_c808c001-4a3b-4cab-84c7-a5c24663bb6a.png)