In C++

Consider the row of coins (all positive): 3 5 7 8 2 1 4 3 6 10 9 7 8 5. Formulate/design a dynamic programming solution for picking up the maximum amount of money subject to the constraint that no three adjacent (consecutive) coins can be collected. Clear define the variables and functions. Use your formulation to find the maximum amount that can be collected