CPU Scheduling. Consider the following single-thread process, arrival times, and CPU process requirements: Process ID Arrival Time Burst Time Priority 1 1 3 1 N N 3 3 3 N 4 2. 4 4 4 1 4 All schedulers are preemptive. The time quantum of the Round-Robin (RR) is 1. The RR schedulers ignore processes priorities. In the case of the RR scheduler, a new arriving process is inserted at the end of the ready queue. When the RR quantum expires, the currently running thread is added at the end of the ready list before any newly arriving threads. Assume that context switch overhead is 0. When a process arrives, it is immediately eligible for scheduling, e.g., process 2 that arrives at time 2 can be scheduled during time unit 2. If two processes arrive at the same time, they are inserted to the ready queue in the ascending order. That is, if process 1 and process 2 arrive at the same time, process 1 is inserted first, and process 2 second in the ready queue. The SRTF scheduler uses priorities to break ties, i.e., if two processes have the same remaining time we schedule the one with the highest priority 3. Consider the same processes and arrival times, but assume now a processor with two CPUs. Assume CPU O is busy for the first two time units. For each scheduling algorithm, fill the table with the ID of the process that is running on each CPU. In this part, you don't need to consider process priorities. For any non-time-sliced-based algorithm, assume that once a process starts running on a CPU, it keeps running on the same CPU till the end. . If both CPUs are free, assume CPU O is allocated first. Fill the blank with "X" (capitalized X) if the CPU is not available. Time CPU # FCFS RR SJF 1 1 0 1 3 0 1 1 0 1 6 0 1 1 8 0 1