CPU Scheduling (40 points) ProcessBurst Time Priority Arrival Time P1 P2 P3 P4 12 3 4 1 2 0 2 4 6 4 18 Table 1: Process Information. Consider the processes described in Table 1. Questions: What is the average waiting time of those processes for each of the following scheduling algorithms? (Draw a Gantt chart for each algorithm.) (a) First Come First Serve (FCFS) (b) Non-preemptive Shortest Job First (NP-SJF) (c) Preemptive Shortest Job First (P-SJF) (d) Priority Scheduling (e) Round Robin, with the following assumptions: Assumption (1). The scheduling time quantum is 5 time units. Assumption (2). If a new process arrives at the same time as the time slice of the executing process expires, the OS puts the executing process in the ready queue, followed by the new process