Problem: A min-heap is a heap where every node has a value that is less than or equal to its children. Suppose we are given a max heap A.
a. Is it possible to convert the max heap into a min heap by reversing the elements of the array representation? If yes, explain why; if no, provide a counter-example.
b. How can we convert a max heap into a min heap in O(n) time? Just explain your answer. No need for pseudo-code or proofs.