Question 3 10 points Save Answer Consider the change making problem with denominations d1 = 1, d2 = 4, d3 = 7 and its dynamic programming solution. Let F(n) be the minimum number of coins whose values add up to n. How do you find F(20)? F(20) = min{F(13), F(16), F(19)} +1 F(20) = 2F(7)+F(4)+2F(1) F(20) = F(19) + 1 F(20) = min{ F(18) + 2, F(19) + 1}