Each deleteMin operation uses 2logN comparisons in the worst case. N is the number of nodes in the heap structure. 1. Propose a scheme so that the deleteMin operation uses only logN+loglogN+O(1) comparisons between elements. This need not imply less data movement. 2. Extend your scheme in the previous question so that only logN+logloglogN+O(1) comparisons are performed