Consider three processes P1, P2, and Pz all ready to run at time. Each process has two CPU Dursts, separated by a single vo burst when its first cu burst completed, each process requests a blocking operation on an O device. It becomes ready for the second CPU burst only when its 1/0 bust completes The CPU scheduling policy is non preemptive Shortest.job. First The system has only one CPU. The lengths of the CPU bursts of the processes are given below: P1:5 ms (each CPU burst) P2: 8 ms (each CPU burst P3: 6 ms (each CPU burst) When a process starts receiving service for wo its vo burst takes toms a. Assume each process Piperforms /on a separate to device). Assume FCS scheduling on all o devices. Give the Gantt Charty for the u Dr. Di and by separately (See the note below on how to give timing information for Gantt charts without drawing a chart. Finally, we the average tumaround times tortene processes b. Now, assume each process Pi performs 1/0 on the same o device. Assume FCFS scheduling on the vo device D. Give the Gantt Charts for the cru and D separately (See the note below on how to give timing information for Gantt charts without drawing a chart, Rinally, give the average turnaround times for these processes Directions for giving Gantt charts in writing Assume in your solution for the CPU. the process A runs from time - 0 to 10, processions from time 10 10 is the CPU is idle from time - 15 to 20, and finally the process Cruns from time - 20 to 25. Then you can write CPU: A TO, 10), B110, 151. idle [15, 201, D 20, 251