Consider the pseudo code below

1a) What does it do?

A. It merges two sorted arrays into a single sorted array

B. It divides up an array into two sorted arrays

C. It copies the elements from two arrays into a single array

D. All of the above

E. None of the above

1b. What is its worst case runtime?

A. (N)

B. (M)

C. (M+N)

D. (MN)

E. None of the above

A+ a sorted array of N integers B = a sorted array of M integers C - an array of size N + M io j while(i = N) C[i+j] + B[j] j++ else if(j >= M) C[i+j] A[i] i++ else if(A[i]