Please Register To Attempt Complete Test

Create Account

**
Consider three pegs A, B, C and four disks of different sizes. Initially, the four disks are stacked on peg A, in orderof decreasing size. The task is to move all the disks from peg A to peg C with the help of peg B. themoves are to be made under the following constraints:
**[i] In each step, exactly one disk is moved from one peg to another.

[ii] A disk cannot be placed on another disk of smaller size. If we denote the movement of a disk from onepeg to another by y → y, where y, y are A, B or C, then represent the sequence of the minimum numberof moves to accomplish this as a binary tree with node labels of the form (y → y) such that the in-ordertraversal of the tree gives the correct sequence of the moves.If there are n disks, what is the total number of moves required in terms of n. Answer can be an expression in terms of n.