Select all the statements below which are TRUE:

Any comparison sort algorithm requires (nlgn) comparisons in the worst case.

Quick sort is not a comparison sort because it calls the PARTITION function.

Counting sort is not a comparison sort.

The number of leaves in the decision tree of a comparison sort is where n is the number of elements to be sorted.

Any sorting algorithm has running time (n) since it has to traverse the sequence of elements.

Merge sort is asymptotically optimal comparison sort.

0(n!)