Show the heap diagram if the following operations are performed on an empty heap-based priority queue. Insert(15, A), Insert(28, B), min(), Insert(12, C), Insert(17, D), Insert(8, E), min(),Insert (14, F), Insert(18, G), removeMin() , Insert(6, H), removeMin(),Insert(9, I), Insert(7, J), removeMin()