only one disk ( from to this is the base casewhen you're moving only one diskyou just move itthere' nothing else to do then move the larger disk ( from to cand replace the subtree (disk on it figure 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 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 disksbut you can recompile the program with any number listing the towers java program /towers java /evaluates triangular numbers /to run this programc>java towersapp import java io */for / ///////////////////////////////////////////////////////////////class towersapp static int ndisks public static void main(string[argsdotowers(ndisks' '' '' ')//public static void dotowers(int topnchar fromchar interchar to