Consider the array A = [18, 9, 7, 2, 15, 12, 5]. Trace through the quicksort algorithm on this array. Use the last element as the pivot. For each recursive call, draw the execution stack (don't worry about other methods such as main()), show the pivot, and show the arrays smaller, equal, and larger. During some of the recursive calls some of the sub-arrays will be adjusted so that they become sorted, make sure this happens in the correct recursive call!