71 81 77 15 63 96 36 51 77 18 17 Show the contents of the array above each time a Merge Sort changes it while sorting the array into ascending order. Please explain your work and your answer.

Following are the solution to this question:

Explanation:

This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.

It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.

Please find the attachment file of the sorting.