Please do all parts... thanks... Ill give a thumbs up

[10 Points] Given the following array of int elements: int numbers = {7, 2, 8, 4, 1, 11, 9, b. 5, 3, 10); You don't need to write the code. Just show the working. Show the state of the elements after 5 passes of the outermost loop of selection sort. i. i. Show a trace of 2 levels deep of the merge sort algorithm. Show the splitting of the overall array, plus one level deep of the recursive calls