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.