2. In class, we considered multistage games in which every stage game was either static or dynamic with perfect information. This problem considers a repeated game where the stage game is a dynamic game with imperfect information. Specifically, suppose that the stage game is the following game from pset 4: L B H 2 2 R S R F G (1,3) (4, 4) (-1, -1) (2,2) (6,1) (8.8) More precisely, suppose that this game is played twice, and thats = 1. a. How many subgames start in the second period? How many information sets does each player have in the repeated game? b. Find some pure SPNE of the repeated game. c. Are there two (or more) pure SPNE prescribing different payoffs for any of the two players? Why