in a clear way please

A. [2 points] Draw the above min-heap after performing the enqueue (0) operation. B. [2 points] How many comparisons (exactly) will the enqueue(0) operation make on the above heap? How many swaps? C. [2 points] Draw the heap after a dequeue() operation is performed. Apply the change to the original heap