Merge sort, the recursion part

Question

After studying the merge sort for a couple of days, I understand it conceptually, but there is one thing that I don\'t get.

What I get:

1.) It takes a list, for

Answer 1

If you are talking about odd numbered sub lists, then it is dependant on the implementation.

It either puts the bigger sub list on the left every single time, or it puts it on the right every single time.