Which of the following statements about the quick sort algorithm is true?

Quick sort is a stable sorting algorithm by default.

Quick sort guarantees a worst$-$case time complexity of $O(nlog(n))$

The efficiency of quick sort is not affected by the choice of the pivot.

Quick sort uses a divide$-$and$-$conquer strategy to sort the elements of an array.