What are the running times for the worst and the best case in deterministic QuickSort, respectively?

Group of answer choices

(n^2), (n log n)

(n^2), (n^2 log n)

(n), (n log n)

(n log n), (n^2)

What are the running times for the worst and the best case in deterministic QuickSort, respectively? (n^2), on log n) | 0 n^2), en^2 log n) (n), (n log n) on log n), O(n^2)