In the Coin Change problem (finding the minimum number of coins to make change for amount V, given coin denominations C = {c1, c2, ..., ck} with unlimited supply of each coin), what is the correct Dynamic Programming state transition?
- A`dp[v] = min(dp[v], dp[v - c] * c)` for all `c in C` with `c <= v`
- B`dp[v] = min(dp[v], dp[v - c] + 1)` for all `c in C` with `c <= v`, initialized with `dp[…
- C`dp[v] = max_{c in C} (dp[v / c] + 1)`
- D`dp[v] = dp[v - 1] + dp[v - 2]`