Solve the given problems A and B Consider the following set of processes, with the length of theCPU burst time given in milliseconds:Process Arrival TimeCPU Burst Time/Service Time/Processing Time3PriorityP102P2153P3221P4333P5444a) Draw the Gantt charts illustrating the execution of theseprocesses using:1. FCFS2. SJF (SPN)3. SRT4. HRRNs a nonpreemptive priority (a smaller priority numberimplies a higher priority)6 RR (q=1)7. RR (q=3)& Combining RR (q-2) and priority scheduling9. Feedback (q-1)10. Feedback (q-2)b) Fill out the following table for each of the schedulingalgorithms in part a.ProcessArrival Starting Completion Response Waiting TurnaroundTime TimeTimeTime TimeP1 0TimeP21P32P43P54Average Assume that process Pl has a period of pl = 90 and a CPU burst of t1 = 35..For process P2, the corresponding values are p2 = 40 and 12 = 20.Draw the Gantt charts till the time 160 illustrating the execution of these processes along with their deadlines using:Rate-monotonic schedulingEarliest-deadline-first (EDF) scheduling

Name: Solve the given problems A and B Consider the following set of process
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Solve the given problems A and B Consider the following set of processes, with the length of theCPU burst time given in milliseconds:Process Arrival TimeCPU Burst Time/Service Time/Processing Time3PriorityP102P2153P3221P4333P5444a) Draw the Gantt cha