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

- The minimum possible time complexity of a comparison-based sorting algorithm is O(N log N) for a random input array.
- Any comparison-based sorting algorithm can be made stable by using the position as a criteria when two elements are compared.
- Counting Sort is not a comparison-based sorting algorithm.
- Heap Sort is not a comparison-based sorting algorithm.

Choose the correct option.

- 1,2.
- 2,4.
- 4.
- 2.