1. Consider the following normal-form game (where player 1 has strategies U, M, D, player 2 has strategies L, C, R, and in each cell of the table the first number is the payoff to player 1 and the second number is the payoff to player 2): L C R U 1, 1 5,0 2, 1 M 0, 3 8, 2 1, 3 D 1, 1 2, 1 2, 2 (a) What is the reduced game surviving the procedure of iterated elimination of strictly dominated strategies (IESDS)? (b) Find all the pure-strategy Nash equilibria. And find all the mixed-strategy Nash equilibria