Show, in the style of the trace given with partition(), how that method partitions the array I, L, O, V, E, A, L, G, O, R, I, T, H, M, S 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 ease scenarios for the quicksort algorithm