Consider the merge step of the merge sort.
a. What is the minimum number of comparisons needed to merge two subarrays each of size n/2?
b. Give a recurrence relation that counts the number of comparisons made in the best case.
c. Make an educated guess at the solution to the recurrence relation.