Scheduling algorithms Assume a processor scheduler which needs to handle the following incoming processes Process P1 Arrival time 10 Burst time 31 For each of the following processor scheduling algorithms: * show the schedule by filling in the table what process is being run in each time interval calculate the wait times defined as the time between arrival, and the time when first scheduled to run) average turnaround time (defined as the time between arrival and termination) First come first serve: 1 2 3 4 5 0 P1 6 P1 P2 P3 Avg Turnaround Shortest task first (non-pre-emptive): 0 1 2 3 4 5 6 P1 P2 P3 Avg I - Wait time Turnaround Shortest task first (pre-emptive): P2 Wait time P3 Turnaround Round robin (quantum = 1) 4 56 E P1 P2 P3 Avg Wait time Turnaround