Problem
Design and implement an Ada program to determine whether or not any two consecutive lines typed at the keyboard are anagrams of one another. Two lines are anagrams of one another if they contain exactly the same characters in (perhaps) different order. For example, the following two lines are anagrams. Mildred Smedley slid remedy meld Echo the two lines after both have been read. Then print one of the following messages followed by three blank lines: The above two lines are anagrams! The above two lines are not anagrams! You may assume that no line contains more than 80 characters. You may also assume that the only characters in the lines are the 26 uppercase and lowercase characters of the alphabet and the blank character. Ignore blanks in the input. Consider equivalent uppercase and lowercase letters to be equal. Terminate your program when the first line of the pair contains less than two characters.