Each deletMin operation uses 2longN comparisons in the worst case.

a. Propose a scheme so that the deleteMin operation uses only logN + longlongN +O(1) comparisons between elements. This need not imply less data movement.

b, Extend your scheme in part (a) so that only logN +loglogN + O(1) comparisons are performed.

c.How far can you take this idea?

d.Do the savings in comparisons compensate for the increased complexity of your algorithm?