3. [15 points.] Consider the following set of processes, with arrival time and execution time reported in milliseconds, along with the priority of each process. Note that Pi has higher priority than P, if PrortyP)> Priority(P) Process Priority Arrival Time Execution time 4 0D PM Pob (a) Calculate the average turnaround time for the following scheduling algorithms. Assume a scheduling quantum of 1 millisecond. Also draw a timeline (called a Gantt Chart) illustrating the schedule. i. Priority Scheduling (processes are scheduled in the priority order) ii. Shortest Remaining Time First (the process with the shortest remaining time is executed first) ii. Round Robin (b) Under what conditions will each of the algorithm result in starvation of a particular process? 3. [15 points.] Consider the following set of processes, with arrival time and execution time reported in milliseconds, along with the priority of each process. Note that Pi has higher priority than P, if PrortyP)> Priority(P) Process Priority Arrival Time Execution time 4 0D PM Pob (a) Calculate the average turnaround time for the following scheduling algorithms. Assume a scheduling quantum of 1 millisecond. Also draw a timeline (called a Gantt Chart) illustrating the schedule. i. Priority Scheduling (processes are scheduled in the priority order) ii. Shortest Remaining Time First (the process with the shortest remaining time is executed first) ii. Round Robin (b) Under what conditions will each of the algorithm result in starvation of a particular process