material: advanced algorithms

what is the right answer to this problems? because I am not sure. I appreciate your help. thank you

Question 1 Not yet answered Marked out of 1.00 P Flag question What is min-heap tree? O a. A tree that has minimal value at its root compared to other nodes. Ob. A tree in which each node has a smaller value than its child nodes. OC. A tree in which each node has at least one child node. O d. A tree in which each node has a smaller value than its parent. Question 2 Not yet answered Marked out of 1.00 P Given following Fibonacci heap tree! 2 4 Which notation statement is correct? O a. Rank(2)=2 b. Rank(H)=3 2 c. N=10 Od Tree(H)=5 Question 3 Not yet answered Marked out of 1.00 p Flag question What are the advantages of the Fibonacci Heap Tree over the Binomial Heap Tree? a Less amount of memory used. O b. The tree formation process is more efficient. Oc. No need to do a consolidation process even though the delete min process has been done. O d. All of these are correct. Question 4 Not yet answered Marked out of 100 P Flag question Assume that we have more than one data source, each of which stores data in the form of a tree data structure. Which data structure has the least complexity when adding and deleting data is carried out in each data source? Ola Min Heap Tree Ob Fibonacci Heap Tree O. Binomial Heap Tree d. Binomial Tree