Consider a recursive function called permuteR$($string$,$position$)$ that returns each reordering of the letters in a string.

What is the recurrence relation of permuteR?

Question $11$ options:

T$($n$)=$ K $+$ T$($n$/$log$($n$))$

T$($n$)=$ K $+$ T$($n$-1)$

T$($n$)=$ K $+($n$-1)*$ T$($n$-1)$

T$($n$)=$ K $+$ T$(($n$+1)/$log$($n$))$