Which of the following best describes the state of the Mergesort algorithm just before the final merge?

		A : The recursion gets down to a single element, which is easy to sort.
		B : The first N-1 elements of the array are sorted relative to each other, and only the final element is out of place.
		C : All the elements of the array are sorted except for two, which are swapped.
		D : Two sorted arrays (possibly stored as two halves of a single array).