Part A Enter two strings from keyboard and check whether the strings are anagrams. TRY THE FOLLOWING INPUT SETS: DEAR DARE SEEN NEESA READY DEARY Part B Character data play an important part in many computer problems. It is important to get used to working with character data even though you will find that character data is slightly more difficult to work with in C++ than other high level programming languages. You are to write a program that should read in four words at a time, each word being no longer than 9 characters. The program is to print out each set of words on a separate line, in alphabetical order. After the last set of words has been processed the program is to print out: a)the number of sets processed b)the number of sets that were in alphabetical order to start with, and needed no rearranging. In order to simplify the reading in of the input data, a "procedure" (or subprogram) should be prepared to do most of the work for you. NOTES ON LOGIC The basic algorithm for this problem is a sort routine. 1)You simply get the "largest" word into WORD4 position first. 2)You then get the "second largest" word into WORD3 position. 3)And then you will get the first and second words into their proper positions. (The 4)Swapping is accomplished by three steps: (The first three decision steps do this.) (The fourth and fifth decision steps do this.) sixth decision step does this.) a)move "high value word" to TEMP b)move "low value word" to "low value box" c)move "TEMP" word to "high value box" 5)The SWITCH variable is used to record the occurrence of a "swap". Since SWITCH and "swap" means rearranging was needed, the INORDER counter is