c++

Consider the code of Tower.cpp listed below.

In order to get a better understanding of the code we want to try to read an n=5.

so that we have a:

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_Discussion8

(15 points)

Code of Tower.cpp:

#include #include #include using namespace std;

void moveDisks(int, char, char, char);

void main() { // Create a Scanner int n; cout << ("Enter number of disks: ") << endl; cin >> n; // Find the solution recursively cout << "The moves are:" << endl; moveDisks(n, 'A', 'B', 'C'); cin >> n; }

/** The method for finding the solution to move n disks from fromTower to toTower with auxTower */

void moveDisks(int n, char fromTower, char toTower, char auxTower) { if (n == 1) // Stopping condition cout << "Move disk "<< n << " from " << fromTower << " to " << toTower << endl; else { moveDisks(n - 1, fromTower, auxTower, toTower); cout << "Move disk "<< n << " from " << fromTower << " to " << toTower << endl; moveDisks(n - 1, auxTower, toTower, fromTower); } }