develop an algorithm ...etc

Min-Heap to Max-Heap Algorithm (Min2MaxHeap) You are to develop an algorithm to convert a min-heap to a max-heap. Your goal is to do it as fast as possible in as little space as possible. That is to say, the ideal algorithm would be as fast as possible and would operate in place, i.e. not create new storage for the heap. You may assume a heap implementation if you so desire (such as an array implementation), or you may work with a generalized heap. Deliverables:  Algorithm  Demonstrate the algorithm with the min-heap provided below  Discuss the performance of the algorithm. Be specific in your analysis, i.e. do not just give the Big-O analysis, keep all terms to convince me that yours is better than someone else’s.  Discuss your storage requirements. Code is not needed