Q1 (30 marks): Consider the following set of processes, with the length of CPU burst given in milliseconds: Process Burst time Priority Pl P2 P3 P4 18 10 4 2 The processes are assumed to have arrived in the order P1, P2, P3, and P4 all at time 0 a. Draw the Gantt chart that illustrates the execution of these processes suing FCFS, SJF, Priority and round robin (quantum-4) scheduling algorithms. b. What is the average wait time for each of the scheduling algorithm in part a