THis is from Algorithm's class

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