What does dynamic programming have in common with divide-and-conquer? What is a principal difference between them?

2. Solve the instance 5, 1, 2, 10, 6 of the coin-row problem.

3. a. Show that the time efficiency of solving the coin-row problem by straightforward application of recurrence (8.3) is exponential. b. Show that the time efficiency of solving the coin-row problem by exhaustive search is at least exponential.