Which of the following is not true about comparison based sorting algorithms?

• A. the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array
• B. any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
• C. counting sort is not a comparison based sorting algortihm
• D. heap sort is not a comparison based sorting algorithm.