Consider the following game.
(a) How many proper subgames does this game have?
(b) Solve the game by backward induction and report the strategy profile that results.
(c) Find the set of strategies that survive iterated conditional dominance. Compare these with the strategy you found for part (b).
(d) Compare the path through the tree that results from the strategy you found for part (b) with the paths that are consistent with iterated conditional dominance.