1.a Consider the following list of numbers,

(15, 18, 12, 16, 14, 19, 17)

Show the list after each iteration of the selection sort highlighting the values that moved at each iteration. For example:

(13 21 5 34 8) (5 21 13 34 8) (5 8 13 34 21) (5 8 13 21 34) (5 8 13 21 34)

1.b Would the following code segment work? Why or why not?

1. SelectionSort(a[n]) 2. for i 0 to n 2 do 3. min i 4. for j = i + 1 to n - 1 do 5. if a[j] < a[min] then 6. min j 7. a[min] a[i] 8. return