3. Consider the following set of processes, with the estimated CPU burst given in milliseconds, the processes are assumed to have arrived in the order P1, P2, P3, P4, P5 and P6, at time 0, 1, 2, 2, 3 and 6. Draw a Gantt chart that illustrate the execution of these processes using the following scheduling algorithm: EDF (early deadline first) Process Arriving time Burst Time (CPU) Dead line Time before the deadline P3 P6 a. What is the time before the deadline in each process? (2 points) b. Gantt Chart (4 points) c. Fill in the blank (4 points) Turnaround time Waiting time P5