Solve the Towers of Hanoi game for the following graph G=(V,E) with V={Start, Aux 1, Aux2, Aux3, Dest} and E = {(Start,Auxl), (Auxl,Aux2), (Aux2,Aux3), (Aux3,Aux1), (Aux3,Dest)}. Design an algorithm and determine the time and space complexities of moving n disks from Start to Dest. Implement this algorithm whereby your program prints out each of the moves of every disk. Show the output for n=1, 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.) I would also like the code in java or C++.

You can only move forward unless A3 you can go back to A1. Also can only move one peg per move.