CS 5500 Advanced Operating System Homework \#3 Printer \& Paper Siz Any Frinter 1. Cansider the following set of processes, with the length of the CPL burst given ir milliseconds: Page Orientation The processesi are assumed to have arrived in the order P1,P2,P3,P4,P5, all at tiene 0. a. Draw lisur Giantl charts that illusirate the execution ol' these processes using the follkwing wheduling algorithms: FCFS, SJF, ncapreemptive priority (a larger priority number implies a higher priarity), and RR (quanlumr 2 withwu. considering priority). h. What is the tumaround time of each process for each of the scheduling algorithms in part a? c. What is the 'ruiting rime of encl process for each of these scheduling nigorithms? d. Which of the algorjthms results in the nininvun nverage wairing time (over a]l processesi? 2. The folluwing processes are heing scheduled using a preemptive, priarity-based, ruund-robin scheduling Hesader -1...azm Ench procesg is assigned a numerical prionity, with a higher namber indienting a higher relative priority, For proeesses with the same priority, a round-robio scheduler will be used with a time quantum of L0 ubits. If a process is procmpted by a higher-priority process, the precupted process is placod at the cad of the queac. a. Show the scheduling vriver of the grouceses using a Cianth charl. h. What is the turnaround time fixr each process? c. What is the writing time for ench prosess? Document Margins Ton2.54cm 2.54cm Left Fecing Peges