solve 7

Select all the statements below which are TRUE: Heapsort and Merge sort are asymptotically optimal comparison sorts. Quick sort is not a comparison sort because it calls the PARTITION function. Insertion sort is an asymptotically optimal comparison sort. Any comparison sort algorithm requires Ohm(nIgn) comparisons in the worst case. Bucket sort is not a comparison sort. Any sorting algorithm has running time theta(n) since it has to traverse the sequence of elements