In class, we solved the maximum subsequence sum problem. In that problem, you were given an input array A = [ a₁, a₂,. a_n] I containing real numbers. You had to find the contiguous subsequence with the greatest sum. A contiguous subsequence is a subsequence from A that does not skip elements from A: in other words, it is a subsequence ai, a_i+l, a_i+2, ai+3a_j-2, a_j-3, aj that contains all elements from A that occur between the i-th and j-th elements (e.g., a₅, a₆, a₇, a₈ is a contiguous subsequence, but a₅, a₆, a₇, a₈ is not). Your challenge in this problem is to solve the maximum subsequence product problem. This problem is identical to the maximum subsequence sum problem, except now you want to find the contiguous subsequence with the greatest product a_i X a_i+1 X.X a_k. Assume all values in the array are positive. Design a dynamic programming algorithm to solve this problem. In other words, design a function MaxSubSequenceProduct (array A) that returns indices i and j, such that I <= j. The subsequence A[i,.j] = a_i, a_i+1,, a_j-1, a_j should b the contiguous subsequence that has the greatest product ai X a_i+1 X..X a_k of all the contiguous subsequences from A. What is your function's running time?