a) Table 3 shows the process scheduling for five processes. Each process has its own service time Ts. The turnaround time (TAT) is the residence time, Tr, or total time spent in the system. Assume that the dispatcher time is negligible (around 2 ms) compared to the service time (in the order of a second). Process ID A B D E Table 3. Processes Scheduling Arrival Time (in s) 0 2 4 8 9 Service Time (in s) 4 10 3 8 5 Show the execution pattern for the following uniprocessor scheduling algorithm: i. First-come-first-served (FCFS). (2 marks) ii. Round robin (RR) with time quantum, q=4. (2 marks) iii. Shortest process next (SPN). (2 marks) 3 s+w iv. Shortest remaining time (SRT). (2 marks) v. Highest response ratio next (HRRN) (Hints: R= R is the response ratio, w is the time spent waiting for the processor, s is the expected service time). (2 marks) S Suppose that now we have a dual-core system: vi. Formulate the execution pattern for the multiprocessor scheduling algorithm using FCFS and SRT for the processes listed in Table 3. (3 marks) vii. Evaluate the performance of part (vi) using Normalized Turnaround Time (Tr/T2). Select your optimum multiprocessor scheduling algorithm based on its performance and complexity