[Python] write a recursive quicksort function with the following rules

the initial pivot index must be a parameter of the function.

The function must use recursion The function must also divide the list into lesser than and greater than.

the final list must be a concatination of lesser than + pivot + greater than

Use only basic comparison operators, DO NOT use merge or sort or advanced math from math function.

Quick Sort This is recursive sorting algorithm. Its performance depends very much on a good choice of pivot. When working on an unsorted list with a good choice of pivot, the run time is around ( n logn ) When working on a sorted list and using the leftmost element as the pivot, the run time is O( n2) The derivations of these run times were given in the book and/or lecture. if the list length is 1 or 0, you are done! choose a pivot for each value in theList # a list of one or less elements is sorted! # split the list into a left half # and right half-pivot pivot if value