Trace the complete execution of the merge sort algorithm when called on the list below, similarly to the example trace of merge sort shown in the lecture slides.
Show the sub-lists that are created by the algorithm and show the merging of sub-lists into larger sorted lists.
// index 0 1 2 3 4 5 6 7
// values {29, 17, 3, 94, 46, 8, -4, 12}
List<int> numbers = new List<int> {29, 17, 3, 94, 46, 8, -4, 12};
MergeSort(numbers);
Format your answers with each sub-list surrounded by { } braces, such as {1, 2} {3, 4}.
