Check all of the following that are true statements about quick sort.

Quick sort is stable.

Quick sort is adaptive.

Quick sort is in$-$place.

Quick sort uses memory $($excluding the memory used to accept the input$).$

Quick sort is log$-$linear in the best case.

Quick sort is log$-$linear in the average case.

Quick sort is log$-$linear in the worst case.

Quick sort has a space complexity of in the best case.

Quick sort has a space complexity of in the average case.

Quick sort has a space complexity of in the worst case.

Quick sort splits the array into a left subarray and a right subarray, where the union of these two subarrays would give us back the array.

Quick sort guarantees that the pivot is always in its correct position after partitioning.