Text: Select either Yes, No, or Don't Know (needs more info) for the following algorithms
22. Circle whichever applies to the following:
a) Quicksort is asymptotically faster than bubblesort - In the worst case: No, Don't know; On average: Yes, No, Don't know
b) Quicksort is asymptotically slower than mergesort - In the worst case: No, Don't know; On average: Yes, No, Don't know
c) To sort 8 numbers, it is necessary to make at least 16 comparisons - No, Don't know; 17 comparisons: Yes, Don't know; 18 comparisons: No, Don't know
d) To find 2 heavier coins among 14 same coins using lever scales, it is necessary to make at least 4 comparisons - No, Don't know; 5 comparisons: No, Don't know
e) To find 2 heavier coins among 15 same coins using lever scales, it is necessary to make at least 4 comparisons - Yes, No, Don't know; 5 comparisons: No, Don't know
f) Given set S of points in the Euclidean plane, Voronoi graph of S always contains MST of S - No, Don't know; has at most 3.16*|S| edges: No, Don't know; has at most 3.1*|S| edges: Yes, No, Don't know; has at most 2.75*|S| edges: Yes, No, Don't know; has at most 2.85*|S| edges: Yes, No, Don't know; has at least |S| edges: No, Don't know; has at least |S|+1 edges: No, Don't know; contains edge connecting closest pair of points: No, Don't know
g) Given set S of points in the Euclidean plane, convex hull of S always contains MST of S - No, Don't know; has at most 2.5*|S| edges: No, Don't know; has at least 1.05*|S| edges: Yes, No, Don't know; contains edge connecting closest pair of points: No, Don't know