Consider the best array slice problem: Given an array A of n integers, indexed from 0 to n - 1, find indices and r (with r) that maximize the sum T A[i]. i=l When >r, we evaluate this sum as zero. For example, with the input A = [3,-9, 4, -2, 6, -3, -1, 10, -5, 1, -3, 6], the output should be (2,7), because the greatest possible sum is A[2] + A[3] + A[4] + A[5] + A[6] + A[7] 4+(-2) +6+(-3)+(-1)+10. Best slices are not necessarily unique, and if the array entries are all negative, then the best slices will have l>r. Notice that a best slice could be in the first half in the array (l