Consider the following set of processes, with arrival time and execution time reported in milliseconds, along with the priority of each process. Note that P has higher priority than P if Priority(P> Priority(P) Process Arrival Time Execution time Priority P2 Ps 0 (a) Calculate the average turnaround time for the following scheduling algorithms. Assume a turnaround time for a process is defined as the difference between the time the process finisbed and the time that it had arrived Homework #3 scheduling quantum of 1 millisecond. Also draw a timeline (called a Gantt Chart) illustrating the schedule i. Round Robin ii. Priority Scheduling (processes are scheduled in the priority order) ii. Shortest Remaining Time First (the process with the shortest remaining time is executed (b) Under what conditions will each of the algorithm result in starvation of a particular process