Consider the following game tree. At a leaf, the top payoffs are for player 1, the bottom payoffs are for player2

Exercise 2.1 Consider the following game tree. At a leaf, the top payoffs are for player I, the bottom payoffs are for player II. 2.15. EXERCISES FOR CHAPTER 2 61 4 2 (a) What is the number of strategies of player I and of player II? 3 0 (b) How many reduced strategies do they have? (c) Give the reduced strategic form of the game. (d) What are the Nash equilibria of the game in reduced strategies? (e) What are the subgame perfect Nash equilibria of the game