Solve the Towers of Hanoi game for the following graph G = (V, E) with V = {Start, Aux1, Aux2, Aux3, Aux4, Dest} and E = {Start,Aux1), (Aux1,Aux2), (Aux2, Aux3), (Aux3, Aux4), (Aux4, Dest), (Dest, Aux1)}. Design an algorithm of n disks from start to Dest. Implement this algorithm whereby your program prints out each of the moves of every disk.

Keep in mind that it is 6 rods.

preferably in c++ or python.