Question: An alternate formulation of the maximum contiguous subsequence sum solution is to recursively solve the problems for items in positions low to mid-1 and then mid+1 to high. Notice that position mid is not included. Show how this leads to an O( N log N ) algorithm for the entire problem and implement the algorithm, comparing its speed to the algorithm in the text.