(Solved): .an! Attempt 1 Question 32 (Mandatory) (10 points) Given the following and using the shortest Job N ...

.an! Attempt 1 Question 32 (Mandatory) (10 points) Given the following and using the shortest Job Next (SJN) algorithm: Job A Job B Job C Job D Job E 0 0 Arrival Time Job Time 0 0 0 8 5 1 3 6 A. Is this a preemptive or non-prememptive policy (2 pt.) B. Draw the time line to show the start and stop times of each job (6 pts.) Ex. W---------- ---- --Z 0 1 2 3 C. Computer the Average Turnaround Time for the above time line (2 pt)