Algorithm

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