Develop an algorithm by following complete seven steps of dynamic programming and hand over a hard copy of the assignment before our next class on Thursday. A partial solution of the problem is given in the attached slides from #21 to #26.

Problem: A set of n coins is placed in a row. The coins have positive values which need not be distinct. Find the maximum amount that can be collected given the constraint that no two adjacent coins can be picked up.