Let B. denote a Binomial Tree of order d > 0. If more than one choice is correctselect the red choice. a. More than one of the other choices are correct. b. At least half of the nodes of B, are leaves. The sum of the depths of all leaves in Bg is less than 25 c. The height of Bd is d. The number of nodes of depth k in Bois ( An n-key Binomial Heap is the node disjoint collection of at most 1 + [login heap ordered Binomial Trees. d. The height of Bd is the same as the degree of its root. For any Osk