Q1 (20 marks): Consider the following set of processes, with the length of CPU burst given in milliseconds Process Burst time Priority 18 P2 P3 P4 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. . yroris he punagr wshicdaling algorithm in part