a. Prove that for binary heaps, buildHeap does at most 2N−2 comparisons between elements.b...

a. Prove that for binary heaps, buildHeap does at most 2N−2 comparisons between elements.

---

b. Show that a heap of eight elements can be constructed in eight comparisons between heap elements.

---

c. Give an algorithm to build a binary heap in N + O(logN) element comparisons.