Prove (constructively) that there is a winning strategy for the first player on any n by n board of Gumdrop. If you don't remember the rules of Gumdrop from class, you can refer to the hwl chocolate problem on Blackboard. Hint: The first move is (2, 2). The Chocolate Problem In the game of "Gumdrop", there are n. m gumdrops arranged in an n by m rectangular grid, where n and m are integers > 2. Two players alternate turns, on each turn eating at least one gumdrop. On your turn, you choose a gumdrop of your choice on the grid, at coordinates i, j. You then eat all gumdrops on the grid at coordinates x, y, where x > i and y > j. That is, you eat all gumdrops in the rectangle whose bottom-left coordinates are i, j. The gumdrop at x = 1, y = 1 (the bottom-left gumdrop) is red, and all other gumdrops are green. If you're particularly greedy, you could choose x = 1, y = 1, and eat all the gumdrops. But that would be a bad idea, because whomever eats the red gumdrop loses the game. As you have to eat at least one gumdrop on your turn, you lose if the red gumdrop is the only one left. a) It turns out that whichever player goes first will win if she plays perfectly. Prove it. b) "Gumdrop" is an unsolved game (like Chess, and unlike Tic-Tac-Toe), meaning that no one has figured out the optimal strategy. Explain why this fact does not contradict your answer to part (a).