Need e through h

3. (20 points) True or False. If False, show the reason. (a) No comparison sort can do better than (n log n). (b) On a sequence that is nearly sorted, the Insertion Sort is faster than the Merge Sort. (c) On a sequence that is nearly sorted, the Merge Sort is faster than the Quick Sort. (d) On a sequence that is nearly sorted in reverse order, the Insertion Sort runs faster than the Merge Sort. (e) On a sequence that is nearly sorted in reverse order, the Heap Sort (with max Heap) runs faster than the Merge Sort. (F) If the length of a sequence is doubled, the Selection Sort will take about twice as long to run. (8) The Selection Sort will take the same time to run on a sequence of length n, regardless of the (h) The Insertion Sort will take the same time to run on a sequence of length n, regardless of the (G) The Quick Sort will take the same time to run on a sequence of length n, regardless of the 6) The Heap Sort will take the same time to run on a sequence of length n, regardless of the original original order of the elements. original order of the elements. original order of the elements. order of the elements. Solution: a) true