Problem 5 (4 points). We consider the merge sort algorithm that uses a divide-and-conquer design strategy. The running time of a merge sort algorithm is given below: T(n) = if if is n = 2*, K>1 n = 2 n= 2K, K >1 Prove that the expression giving the complexity of the merge sort algorithm with which you are already familiar is also a solution to the above recurrence. Hint: use mathematical induction