Problem 1. Consider the problem of not only finding the value of the maximum contiguous sum in an array, but also determining the two endpoints. (a) Give a linear time algorithm for solving this problem. If there is more than one sum with the maximum value, find a longest such sum (ie, a sum with the most elements of the array A). Write the pseudo-code. (b) What is the output if all entries are negative