Consider the version of the Tower of Hanoi puzzle in which n disks have to be moved from peg A to peg C using peg B no that any move should either place a disk on peg B or move a disk from that peg. (Of course, the prohibition of placing a larger disk on top of a smaller one remains in place, too-) Design a recursive algorithm for this problem and find the number of moves made by it.