Need help with a Design and Analysis of Algorithms question:

Give a recursive version of the algorithm Insertion-Sort based on the following paradigm: to sort A[1..n], we first sort A1..-1] recursively and then insert A[n] in its appropriate position. Write a pseudocode for the recursive version of Insertion-Sort and analyze its running time by giving a recurrence relation for the running time and then solving it