An anagram is a type of word play, the result of rearranging the letters of a word or phrase to produce a new word or phrase. For example the anagram of tea is tea, tae, eat, eta, aet, ate.
Anagrams can be used to solve word jumble problems. If a user provides a series of jumbled letters, all anagrams of the letters can be generated and then checked to see if they exist in a dictionary. The anagrams appearing in the dictionary are printed as solutions to the puzzle.
Your task for this assignment is to first write a recursive function to generate anagrams from a series of letters that the user of your program provides via the keyboard. Your program must then look up the anagrams up in a dictionary to see if they exist and print out the list of the dictionary words for each sequence of letters. You should use a hash table with separate chaining as the structure to store the letter sequences and the dictionary words that were found.