Select all the statements below which are TRUE.

Let A be a max-heap. Then the nth order statistic is A[1].

Insertion sort is an incremental approach which does the sorting in place.

Quick sort is more efficient than Merge sort.

We can merge two sorted arrays of size n in (n).

If f(n) = O(g(n)), then f(n) = (g(n)).

Let L be a doubly-linked list, sorted in increasing order. Then finding the maximum element can be done in constant time.