Consider the following array of int elements:

int[] numbers = {7, 2, 8, 4, 1, 11, 9, 5, 3, 10};

a. Show the state of the elements after five passes of the outermost loop of selection sort have occurred.

b. Show a trace that is two levels deep of the merge sort algorithm. Show the splitting of the overall array, plus one level of the recursive calls.