I have the following homework question:
Sort the numbers 7 12 8 6 9 1 4 3 5 10 11 2
using merge sort. Illustrate the tree-like structure and the
partitions at each step. (10 points).
I don’t know if this is right. This is what I have worked out:

At step 5 I where not sure what to do. I place a circle on the image. Is this procedure right? I believe this illustration is answering the question.
EDIT
Sorry I should have placed the circle one step before. I place the circle at step 6
Final EDIT
Thanks to your answers I ended up with:

The line where you have the arrow is wrong. The left side of the tree, starting from the beginning, looks like this
And now because all sets are of size 1 or 2, we sort and then merge:
The right side is left as an exercise for the reader 😉