What type of array would yield the worst-case performance for an insertion sort array? What about the best-case performance? Can you improve the worst-case performance of selection sort? Why or why not? How many inversions are present in each of the following arrays? (Two adjacent elements swapping places with eachother denotes an inversion) A: [1,5. 4.3.3.7] B: [5, 4, 3, 2, 1 D: 5, 1, 3, 2, 4 E: |6, 9, 1, 4, 10]