system out printarrchar[ )system out print(")system out flush()if(count% = system out println("")//public static string getstring(throws ioexception inputstreamreader isr new inputstreamreader(system in)bufferedreader br new bufferedreader(isr)string br readline()return ///end class anagramapp the rotate(method rotates the word one position left as described earlier the displayword(method displays the entire word and adds count to make it easy to see how many words have been displayed here' some sample interaction with the programenter wordcats cats cast atsc atcs tsca tsac scat scta ctsa asct tcas satc ctas astc tcsa sact csat acts tasc stca csta acst tacs stac (is it only coincidence that scat is an anagram of cats?you can use the program to anagram -letter or even -letter words howeverbecause the factorial of is this may generate more words than you want to know about the towers of hanoi the towers of hanoi is an ancient puzzle consisting of number of disks placed on three columnsas shown in figure the disks all have different diameters and holes in the middle so they will fit over the columns all the disks start out on column the object of the puzzle is to transfer all the disks from column to column only one disk can be moved at timeand no disk can be placed on disk that' smaller than itself there' an ancient myth that somewhere in indiain remote templemonks labor day and night to transfer golden disks from one of three diamond-studded towers to another when they are finishedthe world will end any alarm you may feelhoweverwill be dispelled when you see how long it takes to solve the puzzle for far fewer than disks the towers workshop applet