Consider the following algorithm: MERGE-SORT(A) 1 if length[A] == 1 2 return A 3 else 4. q+ [length[A]/2] 5 create arrays L[1...) and Rq +1.. length[A]] 6 copy A[1..] to L 7 copy Alq + 1.. length[A]] to R 8 LS - MERGE-SORT(L) 9 RS + MERGE-SORT(R) 10 return MERGE(LS, RS) MERGE(L, R) 1 create array B of length length [L] + length[R] 2 it1 3j+1 4 for k + 1 to length[B] 5 if j > length(R) or (i