Question: 106 (Choose 1 answer)
Let f(n) be the complexity of the merge sort algorithm on the sequence of size n in terms of the number of comparisons. The recurrence relation of f(n) is as follows: f(n) = a.f(n/2) + n, with n even. Determine a.
A. 1
B. 2
C. 3
D. 4
E. None of the other choices is correct
