Write down the underlying tree structure as a pair of nodes and edges, just as is done in the examples in the handout. Write down the list of terminal nodes, just as is done in the examples in the handout.

In your answer, be sure to complete the following tasks:

Write down the list of players, just as is done in the examples in the handout.
Write down the underlying tree structure as a pair of nodes and edges, just as is done in the examples in the handout.
Write down the list of terminal nodes, just as is done in the examples in the
handout.
Write down a function i that maps a player to each non-terminal node of the tree, just as is done in the examples in the handout.
For each player, write down a function Ai that assigns an action set to each non-terminal node for that player, just as is done in the examples in the handout.
For each player, write down a payoff function vi that assigns a payoff to each terminal-node for that player, just as is done in the examples in the handout.
For each player, write down a set of information sets Hi, just as is done in the examples in the handout.