Assignment One: Question one This is a coin game for two players. The rules are as follows: There is a 1 x n rectangular region which consists of n unit squares. We start by putting /1 coins on each square. Each player then takes turns to remove 1 or 2 adjacent coins. Once a coin is removed, the coins to the left and to the right of the removed coin are not considered to be adjacent. Assignment One: Question one = The one who takes the last coin wins a) State the Zermelo's Theorem. b) For a given n, apply Zermelo's Theorem to show that one of the two players must have a winning strategy. c) For n =10, determine who has a winning strategy and find his/her winning strategy