anagrams here' different kind of situation in which recursion provides neat solution to problem suppose you want to list all the anagrams of specified wordthat isall possible letter combinations (whether they make real english word or notthat can be made from the letters of the original word we'll call this anagramming word anagramming catfor examplewould produce cat cta atc act tca tac try anagramming some words yourself you'll find that the number of possibilities is the factorial of the number of letters for letters there are possible wordsfor letters there are wordsfor letters wordsand so on (this assumes that all letters are distinctif there are multiple instances of the same letterthere will be fewer possible words how would you write program to anagram wordhere' one approach assume the word has letters anagram the rightmost - letters rotate all letters repeat these steps times to rotate the word means to shift all the letters one position leftexcept for the leftmost letterwhich "rotatesback to the rightas shown in figure