Please provide a clear solution.

5 Iterated Elimination 1. [3 points) What strategies survive iterated elimination of strictly-dominated strategies in this normal-form game? U M D L R 2,0 1,1 4,2 3,4 1,2 2,3 1.3 0,2 3,0 2. [8 points) What are the pure strategy Nash equilibria of the game? Find a mixed-strategy NE. 3. [8 points) Prove that iterated elimination of strictly-dominated actions never removes an action that is in the support of any mixed-strategy Nash equilibrium. 4. [3 points] Give an example of a game where no action can be eliminated by iterated elimination of strictly-dominated actions. 5. [8 points) Explain why the time complexity of iterated elimination of strictly-dominated actions is 0(mn+2n?) for n players, each with m ac- tions. 5 Iterated Elimination 1. [3 points) What strategies survive iterated elimination of strictly-dominated strategies in this normal-form game? U M D L R 2,0 1,1 4,2 3,4 1,2 2,3 1.3 0,2 3,0 2. [8 points) What are the pure strategy Nash equilibria of the game? Find a mixed-strategy NE. 3. [8 points) Prove that iterated elimination of strictly-dominated actions never removes an action that is in the support of any mixed-strategy Nash equilibrium. 4. [3 points] Give an example of a game where no action can be eliminated by iterated elimination of strictly-dominated actions. 5. [8 points) Explain why the time complexity of iterated elimination of strictly-dominated actions is 0(mn+2n?) for n players, each with m ac- tions