Why is quicksort not O$($n log n$)$ in all cases? Describe the worst$-$case situation for quicksort and give a list of $10$ integers, $110,$ that would produce this behavior.