Quicksort of Data Structure and Algorithms.

Please take your time solving the problems, do not rush it, I need editable source code.

2. Quicksort 1) Show, in the style ofthe trace given with partitiono, how that method partitions the array I, L, O, V, E, A, L, G, O, R, I, T, H, M, S 2) Show, in the style of the quicksort trace discussed in the book, how quicksort sorts the array I, L, o, v, E, A, L, G, o, R, I, T, H, M, S (for the purpose of this exercise, ignore the initial shuffle) Compare the best, worst, and average case scenarios for the quicksor algorithm