Question 14 (1 point) Consider the array with elements: 18, 10, 20, 5, 8, 9, 3. Applying the heapify() to convert the list to a minimum heap rearranges the elements to: 18 10 3 5 8 9 20 3 10 9 5 8 18 20 35 9 10 8 18 20 3 10 18 5 8 9 20 Question 15 (1 point) Consider DFS in the graph below starting form node E. The next node visited in the partial traversal E H G C F will be node A. A B E F G . True False Question 16 (1 point) Consider the following maximum heap: 20 10 18 58 9 4. After inserting node 15, the heap elements will rearrange to 15 20 18 10 8 94 5 15 18 20 4 98 10 5 20 15 18 10 8 94 5 20 10 18 15 8 9 4 5