please help asap !!!!!

e Edit View History Bookmarks People Tab Window Help y error X Bongo: meetix PPT-dir-CIS X Bongo: meet X Virtual Clax My Drive - Goo docs.google.com/document/d/1JT-9EZOTVcYV3T PKngGw7QJTVKEltpbrRE1x3Wkc/edit documento View Insert Format Tools Add-ons Help Last edit was seconds ago 100% Normal text Arial 9 + BIU A oo - .= = = 2 Consider the following table Proces Arrival CPU Burst 5 A 0 3 B 1 5 c 2 2 D 9 E 12 B Produce the charts, and perform comparison of the following live scheduling algorithms FCFS, RR (quantum 1). RR (quantum 4). SJF, and SRT. If conflict arises on which process to schedule, une newest or the oldest-make sure you indicate which you chose Tumaround time per Algorithm Average fumaround Wanng time per Average wating process time process time A. AR 8- FCFS 0 A- A RAQ 1) D. B. D F E. RRO 8- D D E A 5.JF 0 A- CE MacBook 11 * # 3 $ 4 % 5 & 7 2 6 8 9 ali PIT TIL !!! 2 3 5 6 Consider the folowing table Proces Arrival CPU Burst S A 3 B 1 5 3 2 D 5 E 12 5 olla time E = Produce the Gantt charts, and perform comparison of the following five scheduling algorithms: FCFS, RR (quantum =1). RR (quantum = 4). SJF, and SRT. If conflict arises on which process to schedule, run the newest or the oldest-make sure you indicate which you chose. Turnaround time per Algorithm Average turnaround Waiting time per Average waiting process process time A= B= A= B FCFS C= D C- DE E= A= B RR (Q= AE B C= D 1) C# D E- A= BE RR (Q= AH Ba C= D CE D. 4) E EE A= A BE SJF CE D GH D E- E LAR 3 (4