Consider the Coin-row problem: There is a row of n coins whose values are
some positive integers c1 , c2 ,...,cn , not necessarily distinct. The goal is to pick up the
maximum amount of money subject to the constraint that no two coins adjacent in
the initial row can be picked up. Solve the instance 6, 2, 3, 10, 6, 7 of the coin-row
problem to find out the maximum amount of money you can choose.