Select all the statements below which are TRUE. Quick sort is more efficient than Merge sort. Let A be a max-heap. Then the nth order statistic is A[1] O We can merge two sorted arrays of size n in (n). Let L be a doubly-linked list, sorted in increasing order. Then finding the maximum element can be done in constant time. O Insertion sort is an incremental approach which does the sorting in place. O If f(n) = O(g(n), then f(n) = (g(n))