Consider the following imperfect-information, dynamic game: 1 L 1 R T X 2 U M Y 1 B X D (5,5) Y (2, 2) (3,3) (4,4) (0,0) a. How many information sets does each player have? b. What are the sets of strategies? c. Write down the normal-form representation of the game. d. Find the set of all pure NE. Suppose now that the game has perfect information. e. Find all Backward Induction outcomes. (6,6) (1,1)