What is the answer to this data structures question: The lower bound Ω(n log n) on the running time of an algorithm sorting n elements applies to: Select one: A. all comparison based sorting...

What is the answer to this data structures question:

The lower bound Ω(n log n) on the running time of an algorithm sorting n elements applies to:

Select one:

A. all comparison based sorting algorithms

B. all in place sorting algorithms

C. all stable sorting algorithms

D. all sorting algorithms except the bucket sort

E. all sorting algorithms

NOTE: quite a few questions I have been sending in have not been correct, please can you make sure an expert on the topic area answers the question, thank you.