How many inversions are there in the following array All (42, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2)? Consider running the following algorithms on a large array, once when given an array sorted in ascending order, and once when given an array sorted in descending: HeapSort, InsertionSort, MergeSort and SelectionSort. Which algorithm would have the largest difference in running times for these two inputs? What is the worst-case running time for an efficient algorithm that builds a binary minheap from an array of n elements