shows a bit-reversed counter. We could use the bit-reversed counter to manage the next field of the Fine Grained Heap class. Prove the following: For any two consecutive insertions, the two paths from...

shows a bit-reversed counter. We could use the bit-reversed counter to manage the next field of the Fine Grained Heap class. Prove the following: For any two consecutive insertions, the two paths from the leaves to the root have no common nodes other than the root. Why is this a useful property for the Fine Grained Heap?