MERGE-SORT( array A, int p, int r) 1 if (p < r) 2 then 3 q ← (p + r)/2 4 MERGE-SORT(A, p, q) // sort A[p..q] 5 MERGE-SORT(A, q + 1, r) // sort A[q + 1..r] 6 MERGE(A, p, q, r) // merge the two pieces?

(A) True
(B) False
(C) NAN
(D) NA