answers with explaination . please
Help 1. The time to multiply two nx n matrices is: A. Θ(n D. e(mnp 2. Which of the following is the best approximation for Hmm? (m and n are positive integers) B. Inm +Inn C. Inn D. 1 FI 3. Which sort has both its worst-case and expected times in en 4. Suppose HWhat is the value of n? 5. The function 3log n+ 2n is in which set? 6. Which of the follow ing is not true? Α.heap B.insertion C.merge D. selection A. 4 B. S c. 6 D. 7 A. 2(nlogn) B. (logn) ce(n) D e(nlogn) A. 2″ E3″ C, n-E Ω(n log n) 7. What is n, the number of elements, for the largest table that can be processed by binary search using no more than7 probes? O Type here to search