4. Given the array 17 25 2 4 13 60 47 26 24 15] 17 [8] [2] 3 [4] tell which sorting algorithm would produce the following results after four iterations 24 24 25 47 60 13 17 26 a.1 24 24 60 47 26 13 17 25 L2] 13] 14] 16] 26 25 24 13 60 47 C. 3 17 2 4 5. How many comparisons would be needed to sort an array containing 100 elements using ShortBubble a. in the worst case? b. in the best case? 6. A sorting function is called to sort a list of 100 integers that have been read from a file. If all 100 values are zero, what would the execution requirements (in terms of Big-O notation) be if the sort used was a. Quicksort, with the first element used as the split value? b. ShortBubble C. Selectionsort? d. HeapSort? e. InsertionSort? f. Mergesort