this is from Algorithm class. no need for coding.

1. Design a function (algorithm) that solves the Towers of Hanoi game for the following graph G=(V.E) with V={Start, Aux1, Aux2, Aux3, Dest) and E = {(Start, AuxI). (Auxl. Aux2). (Aux2, Aux1), (Aux2, Aux3), (Aux3,Aux2), (Aux3, Dest)}. Estimate the time complexity of your function, in terms of the number n of disks to be moved