Consider a binomial max-heap BH with k=2M+2 -14 nodes where n>>m. a) Which binomial trees is BH composed of? b) The minimum key in BH is in the most crowded depth level of its largest binomial tree. In terms of k, what is the exact number of nodes you may have to look for the minimum key? (Hint: figure out where the min. key may only exist in a max-heap?) c) A binomial heap BH,& results from merging BH above with BH, with 21+ ... +2m-1+3 elements after two delete-max operations at BH where the maximum key is at the root of B, and the second maximum at the root of Bm-1 (i.e., first the two delete-maxs then the merging). i. How many nodes does BH, have? ii. What binomial trees is BH res composed of? Consider a binomial max-heap BH with k=2M+2 -14 nodes where n>>m. a) Which binomial trees is BH composed of? b) The minimum key in BH is in the most crowded depth level of its largest binomial tree. In terms of k, what is the exact number of nodes you may have to look for the minimum key? (Hint: figure out where the min. key may only exist in a max-heap?) c) A binomial heap BH,& results from merging BH above with BH, with 21+ ... +2m-1+3 elements after two delete-max operations at BH where the maximum key is at the root of B, and the second maximum at the root of Bm-1 (i.e., first the two delete-maxs then the merging). i. How many nodes does BH, have? ii. What binomial trees is BH res composed of