Recurrence Relations · Recursive Algorithms
Lesson 4
Problem. In a more complex version of the puzzle, finding a solution is not as straightforward, but we will soon learn how to do it. Suppose the disks have radii from \(1\) to \(n\), and now moving a disk of radius \(i\) costs \(i\) units. What is the minimum cost to move all disks?
5 points