This is for an Introduction to Algorithms course, so no specific programming language should be used.

Please write the algorithm in general pseudocode and provide Proof of Correctness and Runtime Analysis.

Please show your work, and DO NOT use any pre-existing solutions to this question on Chegg Study.

Given a sequence of integers 21, ..., &n (possibly including negative integers) and an interval of coordinates I = [i, j], write xj to denote the sum Lisks; Lk. Give a linear time algorithm to find the interval that maximizes xj