7. In this lecture note, the quicksort algorithm is given. (a) Write the pseudocode for quicksort. (Or, a source code program in Java programming language. If this is the case, you are ONLY required to copy your source code in a Word file.) (b) Show that its worst-case running time on an array of size n is O(n*). (Or, if you use source code, then create an input array AIO. 100] as your input, and compute the number of your basic operations to establish it is O(n2 ).) (c) Show that its expected running time satisfies the recurrence relation Then show that the solution to this recurrence is Q(n log n)