(1) (10 pts) Write your own explicit pseudo-code for MERGE(A, p, q, r) to merge sorted sub-array A]p] --- A[q] and sorted sub-array A[q+ 1]... A[r] back into A[p] ... A[r] using additional array(s) as needed. Your code must run in (r - p+1) time (i.e. time bounded by the total number elements in the two sorted sub-arrays being merged)