Please proof my work and show the answer! I would greatly appreciate it!!

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, AUX) (Aux2, Dest). (Dest, Start)). Estimate the time complexity of your function, in terms of the number n of disks to be moved. Exam# 1 2014 TAK Algorithm def Fln , A2) { if (n=1) { move dish to Aux 2} bave case , 42-1ll # of bare else F(n-1 Al) move not dists to Di 1st recursive call move a to Di F (n-1, s); move In-l, si move il distes from D to s 1291 recurswe call Mool n disk to dest F(n-1 DJ; move the not of the docks to dest 13n recorsne call by master Thory The compleants Maste oy 1-3 3:531/ 3" 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, AUX) (Aux2, Dest). (Dest, Start)). Estimate the time complexity of your function, in terms of the number n of disks to be moved. Exam# 1 2014 TAK Algorithm def Fln , A2) { if (n=1) { move dish to Aux 2} bave case , 42-1ll # of bare else F(n-1 Al) move not dists to Di 1st recursive call move a to Di F (n-1, s); move In-l, si move il distes from D to s 1291 recurswe call Mool n disk to dest F(n-1 DJ; move the not of the docks to dest 13n recorsne call by master Thory The compleants Maste oy 1-3 3:531/ 3