Implement a simple uni-processor scheduling simulator. the simulator will step through a sequence of time units, performing the actions of a simple operating system scheduler.

the main input to your simulator will be a file containing processes info containing the following columns

Arrival Priority CPU_Time

ex.

3

0 5 8

3 8 72

5 2 7

rules:

1) arrival times will increase in the input file

2) Your progam will accept and valid input file

3) the will be at most 100 processes

4) lower numbers = highest priority i.e. 0 is highest priority and 9 is lowest priority

The scheduler should be preemptive priority with round-robin Q=2 as a way to resolve ties in priority

Show enough input of the program to show processes being dispatched, preempted, completed ect. at the end of the program show average turn around time.

Thanks in advance.