O O(log n) Question 13 2 pts Select all the correct statement(s) regarding quicksort Quicksort is a divide and conquer algorithm. If we select the median to be the pivot in O(n) time for each partition phase, we guarantee a runtime of O(nlogn) If the median is chosen as the pivot in each partition phase, the partition phase loop (where the left and right indices move until they cross) takes O(logn) time. Only when the smallest element of the list is chosen as the pivot yields an 0 (na) runtime