Consider the following set of processes, their CPU burst tim…

Consider the following set of processes, their CPU burst times, their arrival times, and their priorities (where a higher priority is better) ProcessID  CPUBurstTime ArrivalTime Priority P1 3 0 4 P2 5 2 2 P3 2 5 6 P4 4 7 5   (a) (4pts) Draw a Gantt Chart (timeline) for the task schedule that would be generated using a First-Come, First-Serve scheduler. Find the average waiting time. (b) (4pts) Draw a Gantt Chart (timeline) for the task schedule that would be generated using a preemptive priority scheduler. Find the average waiting time. (c) (4pts) Draw a Gantt Chart (timeline) for the task schedule that would be generated using a preemptive Shortest Job First scheduler(of Shortest Remaining Time first). Find the average waiting time.   The Gantt chart can be drawn as follows since we are taking the test online.   p1(startime-duration) p2(start time – duration)