COMPUTER SCIENCERelate to a recursive sorting algorithm called QuickSort, which is described as follows: A one-element list is already sorted; no further work is required. Otherwise, take the first element in the list, call it the pivot element, then walk through the original list to create two new sublists, $L_{1}$ and $L_{2}.$ $L_{1}$ consists of all elements that are less than the pivot element and $L_{2}$ consists of all elements that are greater than the pivot element. Put the pivot element between $L_{1}$ and $L_{2}.$ Sort each of L1 and L2 using QuickSort (this is the recursive part). Eventually all lists will consist of 1 element sublists separated by previous pivot elements, and at this point the entire original list is in sorted order. This is a little confusing, so here is an example, where pivot elements are shown in brackets: Original list: 6, 2, 1, 7, 9, 4, 8; After 1st pass: 2, 1, 4, [6], 7, 9, 8; After 2nd pass: 1, [2], 4, [6], [7], 9, 8; After 3rd pass: 1, [2], 4, [6], [7], 8, [9] Sorted. How many comparisons between list elements are required for pass 1 of QuickSort on an n-element list?