Consider the tower of Hanoi problem with 3 Pegs (A, B, C) and 60 Disks. All these disks are…
Consider the tower of Hanoi problem with 3 Pegs (A, B, C) and 60 Disks. All these disks are placed in Peg A, where the smallest disk is placed on the top and the largest disk is placed on the bottom. We want to move all these disks from A to C.
1. What is the minimum number of moves required to solve this problem. While moving, consider the same rule as shown in the class.
II. We hire a superhuman to solve this problem. If the superhuman can perform 100 moves per second, what is the total time needed to finish this job? II.