java programming

Assume the following list of keys: 53, 65, 82, 29, 93, 50, 95, 78, 32, 92, 25, 55, 88, 36, 29 The list is to be sorted in ascending order using the quicksort algorithm as discussed in class. Use pivot as the first element of the list. Show step by step for the first call to the split procedure and the resulting list after the call : Show step by step for the second call(s) to the split procedure and the resulting list after the second call(s):