Q4 (7 points) On the answer sheet, answer the following questions. (a) What is the worst-case time complexity of build-heap on n elements? (b) What is the worst-case time complexity of extract-max on a max-heap with n elements? (c) What is the worst-case time complexity of insertion onto a max-heap with n elements? (d) What is the worst-case time complexity of f ind-set in a disjoint set data structure with n elements, assuming we are using union by rank and find with path compression? (c) What is the worst-case time complexity of link in a disjoint set data structure with n elements, assuming we are using union by rank and find with path compression? (f) What is the worst-case time complexity of union in a disjoint set data structure with n elements, assuming we are using union by rank and find with path compression? (g) What is the worst-case time complexity of m operations of union, find, and make-set, including n make-set operations at the start? Q4: Read the instructions for question Q4 in the question document. For each of the eight sub-questions, check the box that most accurately describes the corresponding time complexity. Check one box only. (a): O(1) O(logn) O(n) O(nlogn) O(n2) None of the above (d): O(1) O(logn)O(n)O(m) O(m(m,n)), where (m,n) is the inverse Ackermann function. None of the above (e):O(1) O(logn)O(n)O(m) O(m(m,n)), where (m,n) is the inverse Ackermann function. None of the above (f): O(1) O(logn) O(n) O(m) O(m(m,n)), where (m,n) is the inverse Ackermann function. None of the above (g): O(1) O(logn)O(n)O(m) O(m(m,n)), where (m,n) is the inverse Ackermann function. None of the above