Question 2: Scheduling Problem Consider the following set of processes, with the length of the CPU burst times given in milliseconds: Process Burst Time Priority Arrival Time P1 8 2 0 P2 5 3 6 P3 1 1 8 P4 2 5 9 P5 6 4 10 Note: You should take arrival time into consideration. a. Draw four Gantt charts illustrating the execution of the processes using FCFS, Preemptive SJF (equal burst length processes are scheduled in FCFS), a non-preemptive priority (small priority number means high priority, equal priority processes are scheduled in FCFS). b. What is the waiting time of each process for of the above scheduling algorithms? c. Which of the schedules above results in the minimal average waiting time (over all processes)? Why