Burada soru soru veya yaptrn

the following set of process, with the length of the CPU burst given in milliseconds: Process Name Burst Time P1 Arrival Time 7 Priority P2 0 6 3 P3 1 4 2 P4 1 1 2. P5 2 2 3 4 1 All the process is assumed to have arrived in the order P1, P2, P3, P4 and Ps respectively (But with different arrival times. Please Gantt Charts that illustrate the execution of these processes by using following scheduling alggrithms: FCFS, SJF (Preemptive), Priority (Non-preemptive/Preemptive Smule priority numbers imply a higher priority), and Round Robin (time quantum=2). Fill Gantt chart (process names and times) and each processing time and a waiting time (AWT) for scheduling algorithms. FCFS Scheduling Gantt chart Waiting times for Processes P SJF Scheduling (Preemitive) Waiting times for Process AWT SJF Scheduling Preemive) Priority scheduling (Non-Premi Priority scheduling Premtive TUR