Modern Operating System. Please provide the complete steps. Thank you

b) Consider the following set of processes, with the length of CPU burst given in milliseconds: [Teliti set proses-proses berikut, dengan panjang masa letusan-CPU diberi dalam milisaat.] The processes in Table 4 are assumed to have arrived in the order P1, P2, P3, P4 and P5, all a time 0. [Proses-proses dalam Jadual 4 dianggap tiba dalam turutan P1, P2, P3, P4 dan PS, semua pada masa 0.] i. Produce Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS and RR (quantum =1 ). [Hasilkan Carta Gantt yang menunjukkan perlaksanaan proses-proses ini menggunakan penskedulan FCFS, dan RR (kuantum =1).] (5 Marks/Markah) i. What is the turnaround time of each process for each of the scheduling algorithms (in question 5.(c) (i))? [Berapakah masa pusing-balik bagi setiap proses bagi setiap algoritma penskedulan yang digunakan dalam soalan 5(c)(i) ?] (5 Marks/Markah) What is the waiting time of each process for each of the scheduling algorithms used in question 5 (c) (i)? [Berapakah masa menunggu bagi setiap proses bagi setiap algoritma penskedulan (dalam soalan I) yang digunakan? (5 Marks/Markah)