A d$-$heap is a tree with the property that a parent's value is smaller than $($or equal to$)$ the value of any of its d children. We assume that the d$-$heap has N elements.Select one or more:$0$ a$.$The d$-$heap might degenerate after a series of insert operationsO b$.$The largest element is a d$-$heap can be found in O$($log N$),$ in the worst case.O c$.$The largest element must be one of the leaf nodesO d$.$The d$-$heap might degenerate after a series of deletemin operationsOe. Printing the kth smallest element costs O$($Nk$)$ f$.$ Printing N$/2$ elements in order costs O$($N$?)$