Assume that three jobs Job A, Job B, and Job C) are submitted for execution as follows Job id: Arrival time(in milliseconds): CPU cycle time needed: A BC 0 1 2 7 3 4 13) Assume the FCFS) to assign use of the CPU. The average turnaround time is: operating system is using the first-come first-served scheduling algorithm 13.1 10.33 13.2 4.67 13.3 9.33 13.4 5.67 13.5 31 14) Assume the operating system is using the round robin scheduling algorithm (RR) to assign use of the CPU. Assume the time slice being used is 3 milliseconds. The average turnaround time is: 14.1 10.0 14.2 10.67 14.3 19.0 14.4 14.0 14.5 4.7 15) Four conditions must be present simultaneously in a system with a deadlock. 15.1 Mutual exclusion. Starvation. Resource holding and waiting. Circular wait 15.2 Resource holding and waiting. Spooling. Mutual exclusion. Circular wait 15.3 Resource holding and waiting. Blocking. Busy waiting. Critical section. 15.4 Buffering. Blocking. Paging. No preemption. 15.5 Resource holding and waiting. Circular wait. No preemption. Mutual exclusion