NEED ALL STEPS. Thanks in advance!

We can express Insert-sort as a recursive procedure as follows. In order to sort A[l...n], we recursively sort A[l...n- 1] and then insert .A[n] into sorted array A[l...n-1] Write the pseudocode for this recursive version of Insert-sort, name it Insert-SORT-RECUR. Write a recurrence for the running time of of INSERT-SORT-RECUR. Find the solution of this recurrence relation. Is INSERT-SORT-RECUR more expensive than INSERT-SORT