What will be the recurrence relation of the code of recursive selectio

1.	What will be the recurrence relation of the code of recursive selection sort?
A.	T(n) = 2T(n/2) + n
B.	T(n) = 2T(n/2) + c
C.	T(n) = T(n-1) + n
D.	T(n) = T(n-1) + c
Answer» D. T(n) = T(n-1) + c

Discussion