The merge sort algorithm works by __.

(A) ivide: split down the middle into two subsequences, each of size roughly n/2
(B) Conquer: sort each subsequence by calling merge sort recursively on each
(C) Combine: merge the two sorted subsequences into a single sorted list
(D) All of the above