Question #4 (10 points) Consider the Merge Sort algorithm presented in class. Assume that you had access to a constant-time version of Merge(A,p,,r). Provide clear, concise answers to each of the following related questions. (5 points). Provide a recurrence relation, including the base case, which describes the running time of Merge Sort using the constant-time merge operation (5 points). What is the running time of the new algorithm in terms of O-notation? 3