You are picking between a couple different sorting algorithms to sort an array of $n$ integers. Choose the best statement below:

For small $n,$ the efficiency of a sorting algorithm is less important than for large $n.$

For small $n,$ an $O(nlogn)$ sorting algorithm is always faster than an $O(n^2)$ sorting algorithm.

Both of these statements are true.