Suppose we sort an array of numbers, but it turns out ever element of the array is the same, e. g. , 10,10,10 . . . , 10. what is the asymptotic running time of quick sort in this case?