Question

I have my homework due soon, please help me with this question. Thanks!

3. In lecture, we gave a recursive algorithm for the Tower of Hanoi problem which uses Hn many moves to solve the puzzle, where H1 = 1 and Hn+1 = 2Hn +1. One might object that Hn is not an accurate measure of the amount of effort needed to carry out said algorithm; after all, moving a large disk takes more work than moving a small disk! Suppose that for each n, moving the nth disk from any peg to another takes n2 units of effort. Let H be the amount of effort needed to carry out the recursive algorithm. Formulate a recurrence relation which defines Hn. (You do not have to justify your answer. You do not have to solve the recurrence relation.)

Answer 1

Solution :- move which To move the (n+) disks, first we the upper n disks to the middle pea costs Hi effort - After that we move the lower (n+D-th disk to the right-most peg which costs (n + 1) and finally move the n disks from middle to eight-most peg so that tht = ahhh + (n +) is the relation. required necworence