This is a modified problem about the Tower of Hanoi, where there is an extra condition while solving the Consider the Tower of Hanoi problem with peg A, B and C We want to transfer a tower of n disks from peg C. As usual, a larger disk must never appear above a smaller one) in (a). (c)Solve the recurrence and give the complexity of your algorithm