3. Given a pre-sorted array of unique integers, what is the expected running time of Quicksort if the pivot is always chosen to be either the first or last element? a. O(n log n) b. O(n2 log n) c. O(n2) d. None of the above 4. What would be the complexity of Mergesort if the list is divided into 4 chunks instead of 2 each time? a. O(n log n) b. O(n2) c. O(n34) 5. Show the sorting steps of Radix sort for the following input 25, 57, 48, 37, 12, 92, 86, 33