The link below explains divide and conquer with Merge sort.
https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2868/

"
The merge sort algorithm can be divided into three steps, like all divide-and-conquer algorithms:

1 Divide the given unsorted list into several sublists. (Divide)
2 Sort each of the sublists recursively. (Conquer)
3 Merge the sorted sublists to produce new sorted list. (Combine)
"
In the step 2, "Sort each of the sublists recursively". However, the photo below, all the numbers are NOT sorted yet. But the image shows it is the Conquer step.

So which one is wrong, the statement above or the image below?