3.5 Learning Objectives for Exs. 3.5-3.7: To demonstrate that the student understands how the quick sort algorithm sorts a list. Consider list = { 5, 4, 2, 9, 1, 7, 3, 8, 6 } and the quick sort algorithm. Assume we always choose the first list item in the list being partitioned as the pivot, as you did in Project 3. Trace the partition method showing how list is partitioned into listL and listR. To get you started, here is the format of what I am looking for in your solution: list = { 5, 4, 2, 9, 1, 7, 3, 8, 6 }, pivot = 5, leftIndex = -1, rightIndex = 9 While loop pass 1: leftIndex ends up at 0, rightIndex ends up at 6 leftIndex < rightIndex so swap list[0] and list[6]: list = { 3, 4, 2, 9, 1, 7, 5, 8, 6 } While loop pass 2: ... While loop pass 3: ... While loop terminates because leftIndex = pis >= rightIndex = ppartition() returns pso listL = { p}, listR = { p},