Give the run-time complexity of the following code segments. The input size is n. Give the tightest possible bound. Remember to ignore coefficients and lower-order terms 1. (2 points) After inserting n items into a maximum heap in sequential order, what is the worst case performance for finding the single largest item in the tree? Answer: 2. (2 points) After inserting n items into a minimum heap in random order, what is the worst case performance for finding the single largest item in the tree? Answer: 3. (2 points) In a minimum heap of n items, what is the worst case performance for finding the most frequently occurring item inside? Answer (2 points) Given an array of n items, what is the worst case performance for putting the array in heap-order through heapification? Answer 5. (2 points) What is the worst case performance for removing the smallest item from a minimum heap of size n? Answer Give the run-time complexity of the following code segments. The input size is n. Give the tightest possible bound. Remember to ignore coefficients and lower-order terms 1. (2 points) After inserting n items into a maximum heap in sequential order, what is the worst case performance for finding the single largest item in the tree? Answer: 2. (2 points) After inserting n items into a minimum heap in random order, what is the worst case performance for finding the single largest item in the tree? Answer: 3. (2 points) In a minimum heap of n items, what is the worst case performance for finding the most frequently occurring item inside? Answer (2 points) Given an array of n items, what is the worst case performance for putting the array in heap-order through heapification? Answer 5. (2 points) What is the worst case performance for removing the smallest item from a minimum heap of size n