the following pseudocode sorts an array in ascending order using the selection sort algorithm. for last going from n-1 through 1 (n is the size of the array) find largest in array[0 …. last] swap largest with array[last] assume the array looks like the following to begin with. what does the array look like after the first step?