subject: advanced algorithms

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

Question 5 Not yet answered Marked out of 1.00 p Flag question Given the following data 1, 7, 8, 9, 5, 10, 3, 2, 6, and 4. Which is the binomial heap tree of these data if the data are inserted one by one? a Ob. O.c. A 2 Od. 3 2 4 7 Question 6 Not yet answered Marked out of 100 P Flag question It is known that a binomial heap tree B has a level 4 subtree, a level 3 subtree, a level 1 subtree, and a level o subtree. How many nodes are in this binomial heap tree? O a. 28 nodes Ob 26 nodes Oc 29 nodes Od 27 nodes Question 7 Not yet answered Marked out of 1.00 P Flag question Given the following data 1,7,8,9,5, 10, 3, 2, 6, and 4. Which is the Fibonacci Heap Tree of these data if the data are inserted one by one and performed one delete min operation after inserting node 4? O a. Ob 4 Question 8 Not yet answered Marked out of 100 P Flag question Given the following data 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The data insertion process is carried out one by one, then the delete min operation is executed after inserting node 10. Which nodes will be children of node 67 a. Nodes 7. &, and 9 Ob. Only Node 7 O c. Nodes 7 and 8 Od Only Node 8