Part 1) Implement a maxNum function.  This function reads in a list of numbers and returns the largest.
Define this function in a recursive manner.

Test your solution at http://codecheck.it/files/18060406569ovaum1rpro2z1io6yccwcjan.


Part 2) Implement the "fizzbuzz" game.  The function counts from 1 to the specified number, returning a
string with the result.  The rules are:

    If a number is divisible by 3 and by 5, instead say "fizzbuzz"
    Else if a number is divisible by 3, instead say "fizz"
    Else if a number is divisible by 5, instead say "buzz"
    Otherwise say the number

Here is a sample run of this function:

*Main> fizzbuzz 15
"1 2 fizz 4 buzz fizz 7 8 fizz buzz 11 fizz 13 14 fizzbuzz"

Test your solution at http://codecheck.it/files/1808270644exxn4wmxe7wi57mqlclneit03.


When you have finished, generate zip files through Codecheck for each part of the assignment.

Upload each zip file to Canvas.
If you do not have access to Canvas, submit it once you do have access (with a reminder that you
did not have access previously).


IF YOU STILL HAVE TIME AND/OR FEEL LIKE MORE OF A CHALLENGE, download text-adventure.rkt from
the course website and make the following changes:
1) add a player parameter to the one-turn function.
  The head of the list should be the player's name.
  The tail of the list should be a list of items in the player's possession.
2) Change the monster battle so that players only win if they have found
  a weapon before attacking the monster.