Priority Queue (Min-Heap)

Problem Statement:

Visualize a Priority Queue implemented using a Min-Heap. Perform insertions and removals while maintaining heap order.

Operations: Insert 30, Insert 20, Insert 40, Insert 10, Remove Min