In the two-player game "Morra", the players simultaneously hold up some fingers and each guesses the total number of fingers help up.

If exactly one player guesses correctly, then the other player pays her the amount of her guess(in dollars, say). If either both players guess correctly or neither does, then no payments are made.

Consider a version of the game in which the number of fingers each player may hold up is restricted to either one or two.

a. Given the symmetry of the game, each player's equilibrium payoffs is 0 by the result from (some exercise that says: show that in any symmetric strictly competitive game in which U2 = -U1, where Ui is player i's expected payoff function for i = 1,2, each player's payoff in every mixed strategy Nash equilibrium is 0.). Find the mixed strategies of player 1 that guarantee that her payoff is at least 0 (i.e. the strategies such that her payoff is at least 0 for each pure strategy of player 2) and hence find all the mixed strategy equilibria of the game.

b. Find the rationalizable actions of each player in this game.