• Create a priority queue using max heap to store employee details with the fields:
Name, id, salary
• Insert the details of five employees into the binary heap such that highest paid
employee should be given priority.
• Relieve one employee from the binary heap.
• Display the tree after each operation.