There are 6 tokens on the table. Two players alternate removing some of the tokens. In each move any player can either remove exactly one
or exactly two tokens. Whoever removes the last token is the winner (tokens are worthless per se - it does not matter who removed how many of them).
a) Represent this game as a game tree
b) Which player is going to win? Find the subgame perfect Nash equilibrium using backward induction. Precisely describe full strategies.