Describe in words the mechanism of the MergeSort algorithm.

MergeSort is a divide$-$and$-$conquer algorithm for sorting a list $($e$.$g$.$ of numbers$).$ It divides the list into two equal$-$size sub$-$lists, then

these two sub$-$lists are sorted by any sorting algorithm, and then they are merged together.

MergeSort is a divide$-$and$-$conquer algorithm for sorting a list $($e$.$g$.$ of numbers$).$ It divides the list into Nwo sub$-$lists of arbitrary sizes,

then these two sub$-$lists are sorted recursively, and then they are merged together.

MergeSort is a divide$-$and$-$conquer algorithm for sorting a list $($e$.$g$.$ of numbers$).$ It divides the list into three equal$-$size sub$-$lists, then

these three sub$-$lists are sorted recursively, and then they are merged together.

$$ergeSort is a divide$-$and$-$conquer algorithm for sorting a list $($e$.$g$.$ of numbers$).$ It divides the list into two equal$-$size sub$-$lists, then

these two sub$-$lists are sorted recursively, and then they are merged together.

MergeSort is a divide$-$and$-$conquer algorithm for sorting a list $($e$.$g$.$ of numbers$).$ It divides the list into twoyu$-$equal sized sub$-$lists, then

these two sub$-$lists are sorted recursively, and then they are merged together.