Data Structures

(5 pts) Find the number of inversions for the following input: 7 12 9 2 17 3 4 18 13 1 5 6 By swapping 9 and 1, how many inversions will be removed and how many inversions will be added? Sort 7, 12, 9, 2, 17, 3,4,18, 13, 1, 5, and 6 using a. (5 pts) insertion sort. Find the number of swaps in each phase Original 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 After p-12 7 12 9 2 17 3 4 18 13 15 6 # of swaps (5 pts) shell sort using the increments (1,3, 7). Find the number of swaps Original 7 12 9 2 17 3 4 18 13 1 5 6 # of swaps After 7 sort After 3 sort