Suppose that the following processes arrive for execution at the timesindicated. Each

Chapter 6, Problem 6.3

(choose chapter or problem)

Suppose that the following processes arrive for execution at the timesindicated. Each process will run for the amount of time listed. Inanswering the questions, use nonpreemptive scheduling, and base alldecisions on the information you have at the time the decision must bemade.Process Arrival Time Burst TimeP1 0.0 8P2 0.4 4P3 1.0 1a. What is the average turnaround time for these processes with theFCFS scheduling algorithm?b. What is the average turnaround time for these processes with theSJF scheduling algorithm?c. The SJF algorithm is supposed to improve performance, but noticethat we chose to run process P1 at time 0 because we did not knowthat two shorter processes would arrive soon. Compute what theaverage turnaround time will be if the CPU is left idle for the first1 unit and then SJF scheduling is used. Remember that processesP1 and P2 are waiting during this idle time, so their waiting timemay increase. This algorithm could be called future-knowledgescheduling.