I’m working on a Computer Science case study and need support to help me understand better.

Draw (pen-paper or any drawing software) the heap that results from adding the following integers
(34, 45, 3, 87, 65, 32, 1, 12, 17).

Starting with an empty minheap, draw (pen-paper or any drawing software) the heap after each of the
following operations:
addElement(40);
addElement(25):
removeMin();
addElement(10);
removeMin();
addElement(5);
addElement(1);
removeMin();
addElement(45);
addElement(50);