Question 2 10 points Save Answer Consider the coin-row problem and its solution using dynamic programming. Assume the row of coins are: 23516 8 9 4. If F(n) is the maximum amount that can be picked up in a row with n coins. Show how F(7) can be evaluated. (indexing starts at 1). F(7) is the max{ F(6), F(5) +9} F(7) is the max{ F(6) + 9, F(5)} F(7) is the max { F(1), F(2), F(3), ..., F(6)} F(7) is obtained by adding the first seven coins 2 + 3 + .. + 9 = 34