Hello, here is another question.

Thank you in advance!

--------------------------------------------------------------------------------------------------------------------------------------------------------------------

Consider the code of TowerofHanoi.java listing 18.8 page 721.

In order to get a better understanding of the code we want to try to replace the code in line 13 with the following:

moveDisks(5,'A','B','C');

Share with me how many times the moveDisks() is invoked. (15 points)

In order to get a visual understanding of the above statement:

moveDisks(5,'A','B','C');

please consider drawing a tree structure using a word document and submit to me under:

LastName_FirstName_Dis8 (15 points)

--------------------------------------------------------------------------------------------------------------------------------------------------

TowerofHanoi.java listing 18.8 page 721:

import java.util.Scanner;

public class TowerOfHanoi { /** Main method */ public static void main(String[] args) { // Create a Scanner Scanner input = new Scanner(System.in); System.out.print("Enter number of disks: "); int n = input.nextInt(); // Find the solution recursively System.out.println("The moves are:"); moveDisks(n, 'A', 'B', 'C'); } /** The method for finding the solution to move n disks * from fromTower to toTower with auxTower */ public static void moveDisks(int n, char fromTower, char toTower, char auxTower) { if (n == 1) // Stopping condition System.out.println("Move disk " + n + " from " + fromTower + " to " + toTower); else { moveDisks(n - 1, fromTower, auxTower, toTower); System.out.println("Move disk " + n + " from " + fromTower + " to " + toTower); moveDisks(n - 1, auxTower, toTower, fromTower); } } }