Question 3: Consider the following set of processes that need to be scheduled. (20 Points/ 5 Points Each) Arrival Time 0 1 2 3 4 5 Job A B D E F G CPU Cycle 2 4 1 2 3 4 5 1. Use Shortest Remaining Time (SRT) to schedule the arriving processes. Jobs and arrival sequence are given to you in the table above and Calculate the average Turnaround Time: 2. Use Shortest Job Next (SJN) to schedule the batch jobs. Assuming arrival sequence are the same for all in the table above and Calculate the average Turnaround Time: 3. Use Round Robin to schedule the arriving processes. Jobs and arrival sequence are given to you in the table above (Time slice: 3ms) and Calculate the average Turnaround Time IS 4. Based on your calculations which process scheduling algorithm is the best for this set of processes and why? G 7:18 AN 2/13/20 TO ENG