(i) draw the game tree and (ii) explain how many histories (information sets) each player has and (iii) how many strate- gies each agent has:

Suppose that in the first stage player 1 can moveA, B. In the second stage, player 2 choosesuordnot being told anything about 1's move. The twist is that player 1 may face a high cost or a low cost,horl, which is known privately by player 1; player 2 knows only that these costs are equally likely.