In which phase of the Merge Sort algorithm is the majority of the processing work done?

In the Merge Sort algorithm, the majority of the processing work is done during the Merge Phase. This is where the sorted sublists are combined (merged) to form larger sorted sublists. The Divide Phase splits the original list into smaller sublists, and the Conquer Phase recursively sorts those sublists, but the Merge Phase is where the sorting is effectively performed.