answers with explaination

thank you

+) | 100% 1- The time to convert an array, with priorities stored at subseripts 1 through n, to a minheap is in: A. e() B. o(logn) C.ol e performing mergesort on n items is: А.Ollogn) B.o(m + n) C.o(n) D, o(nlogn) 3. Which of the following is not true? 4. The cost function for the optimal matrix multiplhcation problem is: isksj lske isksi 5. The function π + 3n-log n is in which set? 6. f(n)-nlgn is in all of the following sets, except 7. Which statement is comect regarding the wweighted and weighted aetivity seheduling problems? A. O(log n) B.0(log(n)) C. Ω(n) D, dif) A. Both are casily solyed using a greedy techmique D. Weighted is solred using a greedy technique. wmw eighted is solved by dyaamie programming B. Unweighted is solved using a greedy technique, weighted is solved by dynamie programming C. Both require dynanuc programming S. What is the valne of 2