Data Structure, HELP PLEASE & just give me the final answer

Q1

Q2

Q3

What is the total time to trickle-up? O(n log n) 0(1) o(na) O(log n) QUESTION 4 In the insert operation of a heap tree, where is the new node initially inserted? O Anywhere O Next bottom leaf O As a child to the root O At the root Which of the following is a disadvantage of using separate chaining using linked lists? It requires array It does not resolve collision O It requires bucket It requires many pointers