Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and?

(A) There is explicit combine process as well to conquer the solutin
(B) No work is needed to combine the sub-arrays, the array is already sorted
(C) Merging the subarrays
(D) None of above