here is my code so far:

Here is my code so far:

void Hanoi(int m, char a, char b, char c, int& in, int& start) { if (m==1) { DiskIn(m, in, start); cout

This is an example from my textbook:

#include using namespace std;

// function prototype void moveDiscs(int, int, int, int);

int main() { const int NUM_DISCS = 3; // number of disks to move const int FROM_PEG = 1; // Initial "from" FROM_PEGconst int TO_PEG = 3; // Initial "to" peg const int TO_PEG = 3; // initial "to" peg const int TEMP_PEG = 2; // Initial "temp" peg

//play the game moveDiscs(NUM_DISCS, FROM_PEG, TO_PEG, TEMP_PEG); cout

return 0; }

//* *The moveDiscs function displays a disc move in *the towers of Hanoi game. *The parameters are: *num:num: The number of discs to move. *fromPeg: The peg to move from. *toPeg: The peg to move to. *tempPeg: The temporary peg. */

void moveDiscs(int num, int fromPeg, int toPeg, int tempPEg) { if (num > 0) { moveDiscs(num - 1, fromPeg, tempPeg, toPeg); cout 1. Solve the Towers of Hanoi game for the following graph G-(V,E) with V-Start, Aux 1, Aux2, Aux3, Dest) and E ((Start,Aux), (Auxl,Aux2), (Aux2,Aux3), (Aux3,Aux1) (Aux3,Dest)) (a) Design an algorithm and determine the time and space complexities of moving n disks from Start to Dest. (b) Implement this algorithm whereby your program prints out each of the moves of every disk. Show the output for nm1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. (If the output is too long, print out only the first 100 and the last 100 moves.)