Four jobs to be executed on a single processor system arrive at time 0 in the…

In Round Robin scheduling with a time slice of 1 unit, jobs execute in turns. The queue order is A(4), B(1), C(8), D(1). Time 0-1: A runs (3 remaining). Queue: B, C, D, A. Time 1-2: B runs (0 remaining). Queue: C, D, A. Time 2-3: C runs (7 remaining). Queue: D, A, C. Time 3-4: D runs (0 remaining). Queue: A, C. Time 4-5: A runs (2 remaining). Queue: C, A. Time 5-6: C runs (6 remaining). Queue: A, C. Time 6-7: A runs (1 remaining). Queue: C, A. Time 7-8: C runs (5 remaining). Queue: A, C. Time 8-9: A runs (0 remaining). Job A completes at time 9.