Select all the statements below which are TRUE. The Heap sort algorithm uses divide-and-conquer approach. In a min-heap A, for every node i lessthanorequalto (n-1)/2 the value A[i] lessthanorequalto A[2i] and A[i] lessthanorequalto A[2i+1]. Counting sort is a comparison sort algorithm. Let L be a doubly -linked list with n elements. Then finding the successor of an element x takes Theta (n) in the worst-case The Heap sort algorithm is more efficient than the Insertion sort algorithm. Let A be a max-heap of height h. In the worst-case h = Theta (n)