An anagram is a word or phrase formed by rearranging the letters of another word or phrase. For example, the following anagrams can be formed from the word Elvis: Levis, Lives, Veils, and Evils. Write a **recursive function** to generate every anagram from a given word.
Your algorithm should only generate anagrams that are the same length as the original word. (e.g., Levis is a valid anagram of Elvis but Vile is not.)
It should check with a dictionary to find whether the word is a proper one or not(This code snippet is to be used in a word scrambling game)
## Deliverables
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Platform
Turbo C, no pointers please,must use recursion function Must compile in old C