Suppose function call parameter passing costs constant time, independent of the size of the structure being passed.
(a) Give a recurrence for worst case running time of the recursive Binary Search function in terms of n, the size of the search array. Solve the recurrence.
(b) Give a recurrence for worst case running time of the recursive Merge Sort function in terms of n, the size of the array being sorted. Solve the recurrence.