subtree move subtree to aa move bottom disk to ba move subtree to ca puzzle is solved dfigure recursive solution to towers puzzle the towers java program the towers java program solves the towers of hanoi puzzle using this recursive approach it communicates the moves by displaying themthis approach requires much less code than displaying the towers it' up to the human reading the list to actually carry out the moves the code is simplicity itself the main(routine makes single call to the recursive method dotowers(this method then calls itself recursively until the puzzle is solved in this versionshown in listing there are initially only three disksbut you can recompile the program with any number