Question: The max subsequence product problem for an array a = a1,a2,...,an of integers is the problem of determining the largest product E(summation)k=1(bottom) j(top) ak formed by a subsequence of a.
Suppose that all elements of a are nonzero, explain in words a linear-time algorithm for finding the maximum subsequence product.
Describe why your algorithm is right, and why it has linear running time - This one is complex and I don't know how to do it