2 Given the following array (list), follows the following pseudocode to partition the array using the first element, 6. For your reference, here is an article on quicksort with python code: http://interactivepython.org/courselib/static/pythonds/SortSearch/TheQuickSort.html // partition list A[startI..endI] using // A[startI] (first element in the sublist) Partition (A, startI, endI) 1. pivot-A [startI] //set first element as pivot value 2. left -startI+1; //left index 3. right end //right index 4. do 5. I1 increment left until ve find a value larger than pivot or 5 until left--right (alleft]ivot bk left