Java: Answer these questions:

1. Show the state of this list after three passes by exchange sort.

Circle every element that is assured to be in its final sorted position.

12 5 11 19 4 7 8 10 9 6 22 2 9 1 32

2. Show the state of this list after three passes by insertion sort.

Circle every element that is assured to be in its final sorted position.

12 5 11 19 4 7 8 10 9 6 22 2 9 1 32

3. Show the state of this list after three passes by selection sort.

Circle every element that is assured to be in its final sorted position.

12 5 11 19 4 7 8 10 9 6 22 2 9 1 32

4. Show the state of this list after processing by the SetMedianOfThree algorithm. Do not quicksort the list. Circle any items that were moved by this algorithm.

12 5 11 19 4 7 8 10 9 6 22 2 9 1 32

5. Show the state of this list after three passes by quicksort. Use median-of-three partitioning. First quicksort the entire list, then quicksort each of the two resulting partitions. Circle every element that is assured to be in its final sorted position.

12 5 11 19 4 7 8 10 9 6 22 2 9 1 32