![(a). 12 mark] What is the lower bound on the runtime of any comparison based sorting algorithm on n elements? 1. (b). [2 mark] What is the worst-case runtime of quicksort on n elements?](https://media.cheggcdn.com/media%2Fccb%2Fccb0457f-29f7-4fbc-b2e5-de670a79e45d%2FphplkYvJQ.png)
(a). 12 mark] What is the lower bound on the runtime of any comparison based sorting algorithm on n elements? 1. (b). [2 mark] What is the worst-case runtime of quicksort on n elements? Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .