Consider the following simultaneous game:

(a) Suppose this simultaneous game is modified as a sequencial game in which the first mover is the row

player. Draw the game tree. How many strategies does each player have? Find all subgame perfect

equilibria.

(b) Use a game table to describe the sequential game in part (a). Find all Nash equilibria.

(c) Describe the original simultaneous game using a game tree (by introducing information set).

\f