a. (10 points) Given the arrival time and burst time (in milliseconds) of the four processes in the table below, fill in the Gantt chart and calculate the average waiting time using the Preemptive Shortest Remaining Time First. Process Arrive Time Burst Time P 0 8 P 1 4 P. 2 9 Pa 3 5 Gantt Chart: 0 5 10 15 20 25 25 30 35 40 45 50 Average Waiting Time: b. (10 points) Given the following processes characterized by (CPU burst time, period) and assuming that the deadline of each task is equal to the Task's period T1 = (1,4), T2 = (2,6), T3 = (3.8) Assume they all arrive at time 0. Use the preemptive Earliest Deadline First (EDF) scheduler and calculate the CPU Utilization o Gantt Chart: 0 5 10 15 20 25 Utilization: a. (10 points) Given the arrival time and burst time (in milliseconds) of the four processes in the table below, fill in the Gantt chart and calculate the average waiting time using the Preemptive Shortest Remaining Time First. Process Arrive Time Burst Time P 0 8 P 1 4 P. 2 9 Pa 3 5 Gantt Chart: 0 5 10 15 20 25 25 30 35 40 45 50 Average Waiting Time: b. (10 points) Given the following processes characterized by (CPU burst time, period) and assuming that the deadline of each task is equal to the Task's period T1 = (1,4), T2 = (2,6), T3 = (3.8) Assume they all arrive at time 0. Use the preemptive Earliest Deadline First (EDF) scheduler and calculate the CPU Utilization o Gantt Chart: 0 5 10 15 20 25 Utilization