Question 28 T/F To fix Quicksort so the expected time is O(n log n), one should use partition algorithm that partitions the array section into two equal-sized halves; one way to do this is to pick the pivot element randomly; another is to use an algorithm that estimates the median value in the array by, say, picking the median of the first, last, and a few intermediate elements of the array section. This will limit the depth of the recursive calls to O(log n) and, since each level does O(n) work, the total time will be O(n log n) True False Question 29 2 pts T/F Merge sort requires extra space. True False Question 30 2 pts Heap sort requires extra space True False