The divide stage of QuickSort is and the divide stage of MergeSort is Moreover, if the selected pivot is always the median, then the QuickSort achieves complexity. 1 point Vhich of the following statements is FALSE for path compression in union-find data structure? Path compression improves the amortized complexity from O(mlog(N)) to O(mInv.Ackermann (m,N)), for m consecutive operations and N elements Path compression with the "simple version" of Union-Find implementation improves the worse-case complexity of find() from log (N) to inverse Ackermann function, which is much slower than log(N) Inverse Ackermann function grows extremely slowly, and is even slower compared to log(N) Path compression can be easily implemented with simple modification in the standard find (x) function