QUICKSORTIAN par 9. PARTITIONIA P. 3 QUICKSORTIA P. 9-1 4 QUICKSORTIA. 9. 9-10 PARTITIONIA Alr 3 for-ptor -4 if All SX 5 exchange All with All exchange Alival with An 3 return is Which input will give a best case scenario for quick soxt? Select one 075321461 b. 176543211 c123456 d312.756 17654321 What is the best case complexity of quick sort? Select one a01 O(n) CO(nlogn) Od 0(2) OO[log11) Which input will give the worst case scenario for quick sort? Select one 02.756.41 112345671 c. 176543211 17532.1.4.61 11.7654 What is the worst case complexity of quick sort? Select one O a O(n) bon) coflog) d011) On logo)