How would you apply the quick sort algorithm you learned in class to sort the

sequence $8,6,9,6,10,14,7,11?$ Use the in$-$place version as depicted in the slides,

with the pivot being the last element. Show the steps clearly how and when the

swapping between elements occurs. What would be the time complexity of quick

sort if all the elements in the sequence were equal?