This is a modified problem about the Tower of Hanoi, where thereis an extra condition while solving the problem:
Consider the Tower of Hanoi problem with peg A, B and C. We wantto transfer a tower of n disks
from peg A to peg B, if direct moves between A and B aredisallowed. (Each move must be to or
from peg C. As usual, a larger disk must never appear above asmaller one.)
(a) Write a pseudocode to solve the problem recursively.
(b) Set up a recurrence equation to count the number of steps tomove n disks using your method
in (a).
(c) Solve the recurrence and
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured