Suppose you have a Tower of Hanoi, with the three pegs from left to right being A, B, C:

Find a sequence of moves that transfer a tower of n disks from left peg A to the right peg C via middle peg B. A larger disk must never appear above a smaller one. A disk can only move in clockwise, i.e, from A to B, B to C, or C to A.

a) Write pseudo code for this sequence

b) Calculate the number of moves