You can also think of insertion sort as a recursive algorithm. In order to sort , recursively sort the subarray and then insert into the sorted subarray . Write the pseudocode for this recursive version of insertion sort. Give a recurrence for its worst-case running time.