Select all the statements below which are TRUE Consider a decision tree T with height h 3 corresponding to comparison sort of n elements. Then the number of leaves can be 9 Counting sort is stable Let A(1 nj be a max-heap. Then the minimum value in the heap is in the subarray AIPARENT(n)+1... n Let Al1.n] be a max-heap. Then the first order statistic is A[1] O If f(n) = (g(n)), then f(n) = u(g(n)) Quick sort runs very fast in practice