1. In a dynamic programming coin-change solution, you fill an array fewestCoins from 0 to the amount of change.

An element of fewestCoins stores the fewest number of coins necessary for the amount of change corresponding to its index value.

For 29-cents using the set of coin types {1, 5, 10, 12, 25, 50}, determine the value of fewestCoins[29].

2. Complete a recursive relationship for the fewest number of coins as:

3. For the 29-cent solution, what are the specific coins in the solution?

4. How much new information must we store to reconstruct the specific coins in a solution?