please help me out

queue. This cycle will be repeated for 300 time quantum then the priority algorithm will be applied 7. A job with highest priority in the wait queue enters to the CPU cycle for execution after 300 time quantum given to the shortest job/jobs. 8. No job can be terminated before all /O requests are completed. Vrite a C++ program implementing linked list using pointers to simulate the above task for the following ction of each process such as how many times it was in the ready queue, how many times it was each task..., display status of each process at each cycle or stage. nformation. Your output should clearly show each step of the process. You need to keep track of each unning, how many times it was in the I/O queue, what was wait time, total time it took to complete # of I/O Request Priority 10 5 Process Burst Time 100 5000 250 1000 P1 50 P2 P3 14 P4 10 PS 8 160 97 200 30 P8 3500 P10 1500