Problem 3 [20pts]. Design algorithml Critical thinking Given an array representation of min-heap, convert it to max-heap. You don't have to code it (although it is a good practice) but need to explain in detail your proposed algorithm Analyze the running time complexity of your solution (and always think- can you do better?) Example: Input: arrl-35 76 8 20 10 12 18 9)] 6 8 20 10 12 18 9 Output:a [2018 10 12 9 7356 8] OR lany max-heap formed from input elements] 20 18 10 12 5 68 Important note: do not overthink this problem. All you are asked to do is build a max-heap