Augment the algorithm given above so that in addition to providing the maximum (contigu-
ous) subsequence sum (max ), it also provides the indices for the starting and ending terms in
the subsequence associated with max. This means that your modification should determine
the correct values for start (the index for the first term in the subsequence that produced the
maximum sum) and end (the index for the last term in the subsequence that produced the
maximum sum). So, for instance, for the sequence -2, 11, -4, 13, -5, 2, the algorithm correctly
finds the maximum subsequence sum max = 20, start = 1, stop = 3