3. Remember that the selection sort makes n number of passes over the data (where n is the size of the data), with each of the passes, looks for the largest value and, after completing the pass, places it in the proper location. Write the elements of the array below after each of the first 3 passes of a selection sort. (7 points) int[] numbers = {22, 77, 44, 33, 88, 66, 11, 99, 55}; selectionSort(numbers); Before the sort {22, 77, 44, 33, 88, 66, 11, 99, 55} After the pass 1 After the pass 2 After the pass 3