it is binary heap tree.

got the wrong answer.. Can't get right answer help...

Consider converting the number n 405 into binary, using the algorithm shown in Conversion to Binary 1. How many times do you iterate through the outer loop? (Do not count the n0 iteration which will exit the outer loop.) Question 2 0/0.1 pts Consider the same video, and the algorithmotation used at the end of the video. If array All holds 1, 1, O, 1, 0, 1, 1, 1, 0, 0, what number does it represent? 1 Fill in the blanks (with just an integer, no decimals, no commas). Consider the final version of our convert to binary program, running on the number 290,603,295,651. Excluding any initialization, the first time that a value of All gets set, it gets set to , the next value gets and the third value set gets Question1 0/1 pts Consider the following max-heap, given in implicit format 35 18 33 17 5 211 16 2 4 3 10 8 What is the sum of the depths of every node? Question 2 0/ 1 pts Consider the following max-heap, given in implicit format (the heap values are the same as the previous problem) 35 18 33 17 5 211 16 2 4 310 8. What is the sum of the height of every node? 17