Which one of the following statements about sorting and Big$-$Oh is true?

Selection sort could sort a large array of numbers in O$($N$)$ time.

Merge sort achieves an O$($N log N$)$ runtime by dividing the array in half at each step and then recursively sorting and merging the halves back together.

Merge sort runs faster than selection sort because it is recursive, and recursion is faster than loops.

Selection sort runs in O$($N$)$ time if the array is already sorted to begin with, or O$($N$^2)$ if it is not.

Sorting algorithms that rely on comparing elements can only be used with type int, because values from other types of data cannot be compared to each other.