recursion time doanagram(calls itselfit does so with word one letter smaller than beforeas shown in figure called with word cat word cat word at word rotate at display cat word rotate ta display cta rotate cat atc word tc word rotate tc display atc word rotate ct display act rotate atc tca word ca word rotate ca display tca word rotate ac display tac rotate tca cat figure the recursive doanagram(method the base case occurs when the size of the word to be anagrammed is only one letter there' no way to rearrange one letterso the method returns immediately otherwiseit anagrams all but the first letter of the word it was given and then rotates the entire word these two actions are performed timeswhere is the size of the word here' the recursive routine doanagram()