Write proper pseudocode for the Merge method used in Merge Sort, that merges two sorted arrays B[1,..., n], C[1, ..., m] into array A[1, ..., n+m]

Suppose that we would like to use counting sort to sort the following list of numbers . What is the initial C array constructed (not the accumulated)? The last element in array C is 1, fill the following blanks for the first 5 elements starting from the first blank. Insert digits and no decimal points.

ALGORITHM Quicksort(A[l..r])//Sorts a subarray by quicksort//Input: Subarray of array A[0..n − 1], defined by its left and right// indices l and r//Output: Subarray A[l..r] sorted in nondecreasing order  if l < r    s = Partition(A[l..r]) //s is a split position    Quicksort(A[l..s − 1])    Quicksort(A[s + 1..r]) The above code is the quicksort algorithm.Perform a time complexity analysis for quicksort. You need to explain 1) what makes a worst case, what makes a best case, 2) the time complexity for both the worst case and the best case, 3) how to avoid the worst case in practice.

Let A be an array, where each of the n elements is a randomly chosen digit between 0 and 9. For example, if n = 12, this array could be A = [3,5,1,0,5,7,9,2,2,8,8,6]. Determine whether Counting Sort or Merge Sort sorts this array faster.