Question: Can anyone give the answer I don't know how to answer this question I posted all the necessary pics for this question moreover this question

 Can anyone give the answer I don't know how to answer

this question I posted all the necessary pics for this question moreover

this question is related to tower of hanoi Data structure in which

we have to find the time taken by the priest to solve

Can anyone give the answer I don't know how to answer this question I posted all the necessary pics for this question moreover this question is related to tower of hanoi Data structure in which we have to find the time taken by the priest to solve the game ..

INVESTIGATING THE TRUTH OF THE LEGEND ASSOCIATED WITH THE PUZZLE... If the priests do not take any breaks to eat, sleep or go to the bathroom, and move the disks at the rate of 1 disk per second, they need (264-1)/ (60 X 60 X 24 X 365) years to finish the game. Ancient light from the Big Bang has revealed a precise new estimate for the universe's age: 13.77 billion years. How much time does the priests' game take? Activate Windows Go to Settings to activate HOW MUCH TIME DOES IT TAKE TO PLAY THE TOWER OF HANOI? time: 0(21) 021 071 Substituting the sum in the recurrence relation, T(n) = 2k T(n - k) + 2k 1, T(1) = 1 If n -k= 1,k= n - 1. Putting k=n-1, T(n) = 2n-1 T(n-(n-1)) + 2n-1 1 T(n) = 2n-1 T(1) + 2n-1 1 T(n) = 2n-1 + 2n-1 1 T(n) = 2(2n-1) - 1 T(n) = 2n 1 RULES OS 021 07 A larger disk can never be placed on top of a smaller disk. Only one disk can be moved at a time. 170 180 190 200 210 1 Move the top n-1 disks from A to B. STEPS OF SOLUTION 2 Move 1 disk from A to C. OEZ o na OG Move n-1 disks from B to C

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!