(2 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)={22T(2n)+nifn=2ifn=2K,K>1 Prove that the expression giving the complex ity of the merge sort algorithm with which you are already familiar is also a solution to the above recurrence. Hint: use mathematical induction