D-heap is a heap-like structure where every node can have at most d successors. Other properties of standard heap structure are sustained (i.e. tree shape, labels' partial order). Find a method which allows to represent, in an effective way, the d-heap in an array. With this approach design a DelMin algorithm for the d-heap.

Prove the algorithm correctness and estimate its complexity.