# Question SOLVED: Solve the following problem using dynamic programming and recurrence.

Solve the following problem using dynamic programming and recurrence. To solve the problem, you need to set up a recurrence relation. For this, let F(n) be the maximum amount for n coins.

1. Assume that there are six coins 5, 2, 1, 2, 10, 6

Fill out the table:

1. Assume that there are six coins 5, 2, 1, 2, 10, 6

Fill out the table:

You'll get a 48.5KB .DOC file.