Given a picture of a heap, show: The array representation The tree representation after removing the root twice. Initial Index I 0 Arr[i] 1 2 3 4 5 6 7 8 9 Delete Root 5 Index I 0 1 2 3 4 5 6 7 8 Arr[i] Delete Root 10 Index I 0 Arr[i] 2 3 4 5 6 7 8 21 15 45 40 10 39 22 35

3. Draw the binary heap in its tree form from its array form: 0 1 2 3 4 5 6 7 8 9 10 11 12 2 3 4 9 10 17 15 11 9 13 22 20

Given the array: 63 53 86 35 99 34 75 Heapify into a max-heap. Ex: 86, 75, 30

In this task, a binomial heap should be implemented. A binomial heap is implemented byan array with its elements being binomial trees: on the first place there is the binomial treeB0 with one element, on the second place there is the binomial tree B1 with two elements,on the third place there is the binomial tree B2 with four elements,. . . Each binomial treeis implemented recursively using the class BinomialNode. In this class there is nothing toimplement. Methods in this class are needed for the implementation of the methods in theclass BinomialHeap. More precisely, in the class BinomialHeap you should implement thefollowing methods:(i) insert, which takes an integer (a key) and inserts it in the binomial heap. Themethod returns true, if the key is successfully inserted and false otherwise. In thecase, if the array should be resized, use the method resizeArray (see below).(ii) getMin, which returns the minimal key in binomial heap. The implementation willbe also efficient if you…