A d-heap is a tree with the property that a parents 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 all that apply:

a. decreaseKey(p,val), the operation that lowers the value of the item at position p by a positive amount val, costs O(log_d N)

b. Building a d-heap with N successive insert operations costs O(log_d N)

c. Printing all N elements in order costs O(N log_d N)

d. increaseKey(p,val), the operation that increases the value of the item at position p by a positive amount val, costs O(d log_d N)

e. inserting a new element costs O(N) in the worst case

f. Printing the second smallest element costs O(N)