In this question, we will find all the Nash equilibria of the following game. Since the number of actions available to each player is greater than 2, we will try a different strategy here: We will eliminate strictly dominated strategies, and then search for Nash equilibria