Insert and removemin operations for priority queues and heap

just starting out with data structures and algorithms and I need a little need help verifying if my answer is correct.

**Question**:
Assume a priority queue implemented as a sorted list of entries using heap.
Draw the heap after each of the operations: insert(5), insert(7), insert(3), removeMin(),
insert(1), removeMin(), removeMin()
<pre>