Implement two priority queues to simulate an afternoon in on emergency room. Your softwcre should NOT be dependent on the given date. 1. Priority Queue 1 Develop software or use the author's priority queue ADT to implement a priority queue based on a heap. 2. Priority 1Queue 2 Use the STL priorityqueue Test both priorityr queues with the following data assuming that the priority queue is built at noon and Doctor DoGood is the only doctor on duty. Each patient requires 30 minutes of care. The patient who waited the longest has the highest priority unless there is a life-threatening scencrio. Determine the order in which the patients will be treated. you will need to create a timer. Output the time each appointment starts and ends. Assumptions: 1. When a patient's core is interrupted, they still onlyI get 30 minutes of care total 2. If a patient's treatment starts at 1:00 and is not interrupted, then the next potient's treatment will start at 1:30 3. Woitin- time is wait time before noon _ Waitin-T-me hour-=- -:=e- Bub Bleedlns _ Frank Feelingbad \" cm awning \" _ __ -