Consider a two pile version of Nim, i.e., a (2,1) configuration. Suppose it is player 1's turn.

a) Represent the game in extensive (game tree) form and denote the payoffs to the players assuming that the winner gets $1 and the loser gets $0.

b) Who has a winning strategy? Explain.