Hello, I'd like some help with the following question. I'm really trying to understand the concepts so If you could explain what you're doing that would be great. thanks

4. (20 points) Let Hi and H2 be two (binary) max-heaps with ni and n2 elements respectively. If every element in Hi is larger than every element in H2, design an algorithm that merges these two heaps into one (binary) max-heap in O(n2) time (assume that both arrays Hi and H2 are large enough to hold n n2 elements)