We can express selection sort as a recursive procedure as follows. In order to sort A$[1..$n$],$ we recursively sort A$[1..$n$-1]$ by finding $n^{th}$ smallest element and swap it with A$[$n$].$

Write a recurrence for the running time of this recursive version of selection sort.

$T(n)=$