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 D. [2 points] How many comparisons will the dequeued eperation make on the above heap? How many swaps? 3 E. [2 points] Assuming that the above min-heap is the internal representation of a min-priority queue (pq). What is the output of the following piece of code? cout pq. dequeue() cout pq. dequeue() pq. enqueue (0) cout pq.dequeue() cout pq. dequeue()