#include

using namespace std;

void moveTower(int disk, char source, char dest, char spare)

{

// To be implemented

}

int main()

{

cout

cout

cout

cout

int n;

cin >> n;

moveTower(n-1, 'A', 'B', 'C');

return 0;

}

(50') In hanoi.cpp, implement the recursive function moveTower to solve the Hanoi Tower problem (https://www.cs.mu.edu/cburch/survey/recurse/hanoi.html). Please note that we index disks from 0, i.e., an initial tower of 6 disks contains disks 0,1,2,3,4,5. You should just simply use a cout statement to print a line to indicate the movement of a single disk. The final output (i.e. printed-out on your screen) should be a sequence of such movements, which solve the problem of Hanoi Tower. Example Input: 3 Example Output: move disk 0 from A to B move disk 1 from A to C move disk 0 from B to C move disk 2 from A to B move disk 0 from C to A move disk 1 from C to B move disk 0 from A to B