Explain how the merge sort algorithm works. In your explanation, refer to how it would sort the following list of integers: [85, 24, 63, 45].
[85, 24, 63, 45]
You may reference the structure below to support your explanation:
Draw on this
![A diagram showing a tree-like structure starting with a single block [85, 24, 63, 45]. Next level down shows the list split into two blocks: [85, 24] and [63, 45]. The third level down shows each value split into its own single-item block: [85], [24], [63], and [45]. The fourth level down shows these blocks merged back together in pairs of sorted values: [24, 85] and [45, 63]. The final level shows these pairs merged into a single sorted block: [24, 45, 63, 85].](/_next/image?url=https%3A%2F%2Fassets.mathsgenie.co.uk%2Faqa-qb%2F5c5e4124-0d77-400c-8d2b-5826e555fb25.png&w=3840&q=75)