Given a list of distinct integers ao, a-1 a new list that includes all elements of ao,a1, .. . . an with the property that all elements less than p come before p in the list and all elements greater than p come after p in the list. an with ao-p which we will call the pivot, we wish to create , . . . , Consider the following algorithm to do this: Partition (a[0], a[1],....a[n]) 3. while i