The game rules are: You go first when the game starts (that is, you pick your game-winning move first) You and your friend take turns to remove the rest Each of you can remove 1 to 6 pebbles at each turn The one who removes the last pebble will be the winner Write the following function, canAlwaysWin(int n), to see if you can always win given n as your starting quantity of pebbles. Your program is going to analyze whether, out of hundreds of thousands of moves given any n > 0, that there is 100% certainty that you will win. If so, your function returns true, false otherwise:

How would you cite different books by the same author on the works cited page? moore, jack h. folk songs and ballads. salem: poetry press, 1999. print. moore, jack h. ballads in poetry – a critical review. dallas: garden books, 1962. print. moore, jack h. folk songs and ballads. salem: poetry press, 1999. print. –––. ballads in poetry – a critical review. dallas: garden books, 1962. print. moore, jack h. ballads in poetry – a critical review. dallas: garden books, 1962. print. moore, jack h. folk songs and ballads. salem: poetry press, 1999. print. moore, jack h. ballads in poetry – a critical review. dallas: garden books, 1962. print. –––. folk songs and ballads. salem: poetry press, 1999. print.