• Counting Sort is a comparison-based sorting algorithm.
• Counting Sort is inefficient when input elements are drawn from a small range.
• Counting Sort is a stable sorting algorithm.
• Counting Sort runs in linear time when the range of input values is not significantly larger than the number of elements.
• Counting Sort can efficiently sort floating-point numbers.
• Counting Sort has a worst-case time complexity of O(n log n) and this bound is tight.

How many of the following statements about Counting Sort are true?