CSCE 311 Spring 2018 Process Scheduling Due: 2/20/18 at the times shown in the table below and with the . Assume that the following processes arrive indicated CPU burse a) Assaming FCFS process schedaling, draw the Gant chart showing the order in which the Assuming non-preemptive SJF scheduling, draw the Gant chart showing the order in which the processes execute. b) c) Assuming SJR (preemptive SJF) scheduling, draw the Gant chart showing the order in which the processes execute. d) Assuming RR scheduling with quantum processes execute 4, draw the Gant chart showing the order in which the e) Assuming process priority P1:0, P2.3, P3:2, P4:1, draw the Gant chart to show the priority scheduling for these processes. (smaller number higher priority) What is the average waiting time for each of the scheduling algorithms in question 1? b) c) d) 2