Write the function in python for the sudo-code below.

iteration for max subarray don't compute sums from scratch: k=ija[k] can be computed from k=ij1a[k] in O(1) time (really just clever enumeration) MAXSUBARRAY (a[1,,n]) for i=1,,nsum=0forj=i,,nsum=sum+a[j]keepmaxsumfoundsofar return max sum found analysis (O(n)i-iterations )(O(n)j-iterations )(O(1) time to update sum )=O(n2)