please emergancy

15) Consider the following set of processes, with the length of CPU burst given in the table. The processes are assumed to have arrived in the order P1, P2, P3, P4 at time 0. Draw the Gantt chart that illustrates the execution of these processes using the following scheduling algorithms and calculate the average waiting time. (1) First Come First Served (FCFS). (2) Shortest Job First (SJF). (3) Shortest-Remaining-Time-First (SRTF). (4) Round Robin (RR, quantum=2ms). Process P1 P2 P3 Arrive Time 0 1 3 4 Burst Time/ms 3 1 4 2 P4