Sort 7, 12, 9, 2, 17, 3, 4, 18, 13, 1, 5, and 6 using:

a.) Insertion sort. Find the number of swaps in each phase.

b.) Shell sort using the increments {1, 3, 7}. Find the number of swaps

c.) Quick sort with median-of-three partitioning and a cutoff of 4

Original 7 12 92 17 3 4 18 13 1 5 6 # of swaps After p=1 After p=2 After p=3 After p=4 After p=5 After p=6 After p=7 After p= 8 After p=9 After p=10 After p=11 Original 7 12 9 2 17 3 4 18 13 1 5 6 # of swaps After 7 sort After 3 sort After 1 sort Original 7 12 9 2 17 3 4 18 13 1 5 6 After pivot selection Partitioning