Reimplement Exercise •• E14.11 so that you don’t generate new arrays with the subsequences, but instead collect the starting index values. Then implement the generalized merge method so that it receives the array of values to be sorted, and an array list of the starting index values.

Data from Exercise  E14.11 Use the general merge method of the preceding exercise to implement the following sort algorithm. Find all non-descending subsequences of an array (that is, sequences such that a[i]≤ a[i + 1] ≤... ≤ a[i + k]). Some of these sequences might have length 1. Then merge all these sequences.