6. [Xpoints] Below is an incomplete code for Quick Sort, complete the algorithm where indicated as blank lines. (pivot is selected as the last element of the range.) a. (points] def quick_Sort(s, a, b): " Sort the list from S[a] to S[b] inclusive using the quick-sort algorithm." if a >= b: [X points) pivot = s[b] left = a right = b-1 while left