5. (5 pts.) Consider a recursive version of insertion sort. In this version, we recursively call insertion sort on elements 1 to n- 1, and then insert element n into the correct position in the sorted array. Write a recurrence relation for the time complexity of this version of insertion sort, and solve it rigorously (i.e. show what the asymptotic run time of this algorithm is)