Recurrence Relation Merge Sort T N T N 1 O 1 Bt N T N 1 O N Ct N 2t N 1 O N Dt N 2t N 1 O Q37294420

what is the recurrence relation for merge sort?
a. T(N) = T(N-1) +O(1)
b.T(N) = T(N-1) +O(N)
c.T(N) = 2T(N/1) +O(N)
d.T(N) = 2T(N/1) +O(1)
e. none of the above

Answer

recurrence relation for merge sort is T(N) = 2T(N/2) +O(N)Answer: e. none of the above