QUESTION 1 Which of the following statements are true? 1) A binary heap of n elements is a full binary tree for all possible values of n. 2) A heapsort algorithm for a given list first forms a min-heap with the elements in that list, then extracts the elements of the heap one by one from the top. This algorithm will sort a list of n elements in time of O(n). 1 is true, 2 is false. Both are true 1 is false, 2 is true. Both are false. QUESTION 2 Which of the following statements are true? 1) The following tree is a valid binary min-heap: 2) The following tree is a binomial tree: Both are false 1 is True, 2 is False. 1 is False, 2 is True. Both are true. QUESTION 3 Which of the following statements are true? 1. The following tree can appear in a Fibonacci heap. 2. The prefix function for the following pattern: "ababab" is [0,0,1,2,1,2] 1 is true, 2 is false. 1 is false, 2 is true. Both are false. Both are true