[6] MergeSort A. [4] Provide the pseudo-code for the merge process of a Merge Sort algorithm. For reference, below is the pseudo-code of the Merge Sort algorithm: mergesort(E[] array): mergesort(array, 0, array.length-1) mergesort(E[] array, int left, int right): if left =( left + right )/2 mergesort(array, left, center) mergesort(array, center+1, right) merge(array, left, center, right) merge(E[] array, int left, int center, int right): // To Be Implemented B. [1] What is the time complexity of the merge process? c. [1] What is the space complexity of the merge process