Explain how merge sort works

Divide the unsorted list into n sublists, each containing 1 element Repeatedly merge sublists to produce new sorted sublists until there is only 1 sublist remaining This list is sorted