We will say that the pivot provides x x separation if x elements in the array are smaller than the pivot, and n x elements are larger than the pivot. Suppose Bob knows a secret way to find a good pivot with glam separation in constant time. But at the same time Alice knows her own secret technique, which provides separation n 313n, her technique also works in constant time. Alice and Bob applied their secret techniques as subroutines for the QuickSort algorithm. Whose algorithm works asymptotically faster? Prove your statement