send to expert

Problem $1$

B$)$ Write the recurrence equation for the running time $T(n)$ of the RecursiveSelectionSort

function below $($You do nol need to solve it$).$ Provide brief justification for your result.

Assume $n=r-p+1$ is the size of the array $A$ at input.

Array indexes goes from $0$ to $n-1.$

RecursiveSelectionSort $($A$,$ P$,$ r$)$

T $($ n $)=$

n$=$r$-$p$+1$

if $($p