Suppose that we scan over items with keys equal to the partitioning item$$s key

instead of stopping the scans when we encounter them. Show that the running time

of this version of quicksort is quadratic for all arrays with just a constant number of

distinct keys.