Project 1 Anagram Game Program CSCI 111 Programming and Algorithms I Due Tuesday March 5, 11:59PM on turnin 60 Points Only a maximum of 50% of the points are possible if your program does not completely pass the turnin test(s). NEW CONCEPTS: Successful completion of this lab incorporates the following new concepts. . None Task list: 1. Create a source code file named projectl.cpp 2. The program starts by prompting the user if he/she wants to play the Anagram Game. The game continues until the user enters n (i.e. represents the answer no) 3. The game starts by prompting the user to enter 2 words that should be stored. 4. The game should determine if the two words are anagrams of each other (i.e the words share the same letters, but the letters are transposed differently) 5. The game should keep track of the quantity of times the pair of words were determined to be anagrams of each other, and the quantity of times they were not. 6. The game should consider if the words have multiple occurrences of the same letter. For example, the words "pass" and "spas" should be determined as an anagram pair. 7. Refer to the expected output listing below. 8. No credit will be earned if the program is hard-coded with many if-statements that handle only the examples listed. In other words, the program should be able to handle anagrams pairs having 50+ characters per word. SAMPLE OUTPUT user/faculty/jraigoza/CSCI111/Labs/projectl $ ./projectl Do you want to play the Anagram Game? (y-yes, n-no) Please enter word 1 cat Please enter word 2 bird NO. The words are not anagrams of each other because they have different lengths Do you want to play the Anagram Game again? (y-yes, n-no) Please enter word 1 race Please enter word 2 COWS NO: The words are not anagrams of each other. Do you want to play the Anagram Game again? (y=yes, n=no) Please enter word 1 elvis Please enter word 2 lives YES: The words are anagrams of each other Do you want to play the Anagram Game again? (y-yes, n-no) Please enter word 1 listern Please enter word 2 silent YES: The words are anagrams of each other. Do you want to play the Anagram Game again? (y-yes, n-no) Please enter word 1 rotates Please enter word 2 toaster YES: The words are anagrams of each other Do you want to play the Anagram Game again? (y-yes, n-no) Anagram statistics 3 pair (s) of words were anagrams of each other 2 pair(s) of words were not anagrams of each other /user/faculty/jraigoza/CSCI111/Labs/projectl $
