Need this Select all the questions below which are TRUE Let

Need this:

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

Solution

Merging two sorted arrays n takes O(n) is TRUE

Insertion is an incrementak approach which does the sorting in place is TRUE

Quick sort is more effcient than Merge sort is TRUE

if f(n)=O(g(n)),then f(n)=O(g(n)) is TRUE