Select all the statements below which are TRUE.

Select all the statements below which are TRUE. If f(n) = o(g(n)), then g(n)-(f(n)). Dictionary operations (insert, delete, search) are implemented in constant time using direct- address tables. Consider a decision tree T corresponding to a comparison sort of n = 4 elements. Then the number of leaves can be 20. O Any comparison sort algorithm has the worst case running time (nIgn). Let A[1.n] be a min-heap. Then the third order statistics is always A[3 Merge sort algorithm has the sorting in place property