Algorithm Comparison Sorting

Answer with "Yes", "No", or "Don't know".

Explanation please!

Quicksort is asymptotically faster than bubblesort In the worst case Yes No Don't know On average Yes No Don't know Quicksort is asymptotically slower than mergesort In the worst case Yes No Don't know On average Yes No Don't know To sort 8 numbers, it is necessary to make at least 16 comparisons Yes No Don't know comparisons Yes No Don't know 18 comparisons Yes No Don't know To find 2 heavier coins among 14 same coins using lever scales it is necessary to make at least 4 comparisons Yes No Don't know 5 comparisons Yes No Don't know 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 Yes No Don't know