This assignment involves two related games. In each game the two players alternately name dates. The winner is the player who names 31st December and the starting date is 1st January.

Each of the two games use a different rule for the dates the player is allowed to name.

For each game. 1. Devise a winning strategy, stating which player should win. State also if it depends on whether the year is a leap year or not. 2. Write a pseudocode algorithm for optimum play.
The games are. a. (Easy) A player can name the 1st of the next month or increase the day of the month by an arbitrary amount. (For example, the first player begins by naming 1st February or any date in January other than the 1st). b. (Harder) A player can name the first of the next month or the next day of the current month. (For example, the first player begins by naming 1st February or 2nd January).