Tower of Hanoi
a. In the original version of the Tower of Hanoi puzzle, as it was published in the 1890s by E´ douard Lucas, a French mathematician, the world will end after 64 disks have been moved from a mysticalTower of Brahma. Estimate the number of years it will take if monks could move one disk per minute. (Assume that monks do not eat, sleep, or die.)
b. How many moves are made by the ith largest disk (1 = i = n) in this algorithm? c. Find a nonrecursive algorithm for the Tower of Hanoi puzzle and implement it in the language of your choice.