Question 1 In this task, you need to describe how the processes are managed using the scheduling algorithm The following table shows the process arrival time and service time for 6 processes: Process A B D E F Arrival Time 2 3 8 10 10 12 Table 01 Service Time 2 5 6 2 1 6 Part(a) Sketch the execution pattern of all the processes in alphabetical order) if round-robin with a time-quanta of 1 is used. (Note: If the processes arrived together, you are to assume that the process with lower alphabet number will take priority) (10 marks) Part (b) Calculate the turnaround time for the processes (A, B, C, D, E, F) if round-robin with a time- quanta of 1 is used. (12 marks) Part(e) Explain the key design issue of round-robin algorithm