Can anyone walk me through how to do this problem : )

5. Product Sum: Given a list of n integers, v1, . . . , vn, the product-sum is the largest sum that can be formed by multiplying adjacent elements in the list. Each element can be matched with at most one of its neighbors. For example, given the list 1, 2, 3, 1 the product sum is 8 = 1 + (2 3) + 1, and given the list 2, 2, 1, 3, 2, 1, 2, 2, 1, 2 the product sum is 19 = (2 2) + 1 + (3 2) + 1 + (2 2) + 1 + 2. a) Compute the product-sum of 1, 4, 3, 2, 3, 4, 2. b) Give the dynamic programming optimization formula OPT[j] for computing the product-sum of the first j elements. c) What would be the asymptotic running tim