Data Structure and Algorithm (Priority Queues)

Please take your time figuring it out because I want an editable source code that can be run in IDE. Good luck and thank you.

4. Priority queue You have been asked to test the effectiveness of the following different scheduling algorithms for different types of queuing applications. 1) First-In-First-out (FIFo: The jobs are processed in the arriving order. The job at the front of the queue is served until it has completed. That job is then removed from the queue. The next job at the front of the queue is served until it has completed and then it is removed from the queue. This process is continued until the queue is empty. 2) Shortest-Job-First (SJF): The job with the shortest processing time is processed first until it has completed. That job is then removed from the queue. The next job with smallest processing is then served until it has completed and then it is removed fro the queue. This process is continued until the queue is empty