In quick sort, the average case for the number of swaps is O(n log₂n). a. true b. false In quick sort, the list is partitioned into two sublists by selecting a(n) ____, and the two sublists are then sorted and combined into one list in such a way so that the combined list is sorted. a. marker b. pivot c. midpoint d. average It can be shown that the average number of swaps for insertion sort is ____. a. O(n) b. O(n²) c. O(n log n) d. O(n² log n) Merge sort divides the list into ____ sublists of nearly equal size. a. two b. three c. four d. five Heap sort, for array-based lists, is of the order ____ even in the worst case. a. O(log n) b. O(n log n) c. O(log₂n) d. O(n log₂n)