What is the recurrence relation for recursive insertion sort?

The recurrence relation for recursive insertion sort is T(n) T(n-1) O(n), where T(n) represents the time complexity of sorting an array of size n.