Problem 3 [20pts). Design algorithm! 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: arr[] = [3 5 7 6 8 20 10 12 18 9] 3 5 7 1 l 1 6 8 20 10 / / 12 18 9 Output: arr[] = [20 18 10 12 9 73 5 6 8] OR [any max-heap formed from input elements] 20 Il 18 10 / / 12 9.7 3 5 68 Important note: do not overthink this problem. All you are asked to do is build a max-heap