Need A Proper Solution Don'T paste copy Works

Question No. 3 10 Marks Design an algorithm to solve the following 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 following constraints: 1. that no two coins adjacent in the initial row can be picked up. 2. First and the last coins in the initial row cannot be picked up