Hello I have an algorithm question could you help me? Merge Sort algorithm, which uses the divide and conquer approach, is not an in place algorithm, i.e., the amount of extra space it needs is not bounded above by a constant. In this problem, you are asked to calculate the amount of extra space needed by the Merge Sort algorithm. What is the minimum amount of additional space sufficient to sort an integer array of size n via Merge Sort algorithm? Specifically, you need to find a function f(n) such that the answer is (f(n)). You should also prove your claim.