Prove that the first player has a winning strategy for the game of Chomp if the initial board is square. [Hint: Use strong induction to show that this strategy works. For the first move, the first player chomps all cookies except those in the left and top edges. On subsequent moves, after the second player has chomped cookies on either the top or left edge, the first player chomps cookies in the same relative positions in the left or top edge, respectively.]

Afriend of mine is giving a dinner party. his current wine supply includes 10 bottles of zinfandel, 8 of merlot, and 11 of cabernet (he only drinks red wine), all from different wineries. (a) if he wants to serve 3 bottles of zinfandel and serving order is important, how many ways are there to do this? ways (b) if 6 bottles of wine are to be randomly selected from the 29 for serving, how many ways are there to do this? ways (c) if 6 bottles are randomly selected, how many ways are there to obtain two bottles of each variety? ways (d) if 6 bottles are randomly selected, what is the probability that this results in two bottles of each variety being chosen? (round your answer to three decimal places.) (e) if 6 bottles are randomly selected, what is the probability that all of them are the same variety? (round your answer to three decimal places.)