For each algorithm, always explain how and

why it works. ALWAYS analyze the complexity of your algorithms. In all cases, strive to

achieve the fastest possible algorithm

Question $2$: Design a data structure for the following operation. You have a Max

Heap, with an additional operation called Reverse. When Reverse is called, future

deletions should remove the minimum element instead of the maximum. If Reverse is

called again, deletions should return to removing the maximum element. This alter$-$

nating behavior should continue with each call to Reverse.