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