Priority queue
You have been asked to test the effectiveness of the followingdifferent scheduling algorithms for different types of queuingapplications.
1) First-In-First-Out (FIFO): The jobs are processed in thearriving order. The job at the front of the queue is served untilit has completed. That job is then removed from the queue. The nextjob at the front of the queue is served until it has completed andthen it is removed from the queue. This process is continued untilthe queue is empty. Write a program to test the effectiveness ofthis algorithm. Create 100 jobs, each with a random processing timeof 0 to 100 time
OR
OR