Which of the following statements about Counting Sort is true?

A$.$ Counting Sort is a comparison$-$based sorting algorithm.

B$.$ Counting Sort has a worst$-$case time complexity of $O(n^{{?}^{{?}^{?}}}2).$

C$.$ Counting Sort is a stable sorting algorithm.

D$.$ Counting Sort is suitable for sorting linked lists.

Conly

A and $C$

$B$ and $D$

A$,$ B D