Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made.

Process Arrival Time Burst Time Priority level Size of job

P1 0.0 8 3 15k

P2 0.4 4 2 10k

P3 1.0 1 1 25k

Calculate the average turnaround time and produce the Gantt charts for these processes using the following dispatch algorithms:

i. First Come First Serve ii. Round robin with quantum of 2 secs

iii Strict Priority iv. Shortest Job First

v. Shortest Remaining time First