Using the same arrays from the previous problem, trace the complete execution of the merge sort algorithm when called on each array. Show the subarrays that are created by the algorithm and show the merging of subarrays into larger sorted arrays.

Data from Previous Exercise

Write the state of the elements of each of the following arrays after each pass of the outermost loop of the selection sort algorithm has occurred (after each element is selected and moved into place).

int[] numbers3 = {8, 5, –9, 14, 0, –1, –7, 3};

int[] numbers4 = {15, 56, 24, 5, 39, –4, 27, 10};