(1 pt) Execute merge sort on the following array. Write the state of the array after the completion of all merges of size 1 subarrays, then after the completion of all merges of size 2 subarrays, and so on until the array is sorted. Note that this is out of order from how it would be executed recursively that's fine; we're only going for a conceptual understanding of the steps here. [7, 2, 1, 4, 3, 6, 9, 8]