blaul QUESTION 2 a) By referring to the information given in the table below, discuss Round Robin scheduling algorithm. (3 marks) Burst time (milliseconds) 15 Process P1 P2 P3 33 6 b) Draw the timeline of the ready queue for the processes above using the Round-Robin Scheduling algorithm using the following quantum times. The processes arrive in the following order: P2, P1, and P3. i. 5 milliseconds (3 marks) 10 milliseconds (3 marks) Answer the following questions based the information given in the table above; i. Explain Shortest Job First scheduling algorithm and state ONE (1) advantage and ONE (1) disadvantage of the algorithm. (4 marks) ii. Draw the timeline of the ready queue for the processes above using Shortest Job First scheduling algorithm. (2 marks) d) Discuss First Come First Serve scheduling algorithm. Draw the timeline of the ready queue for the processes above using First Come First Serve algorithm. The processes arrive in the following order: P3, P1, and P2. (3 marks) e) A job running in a system with variable time quantum per queue needs 65 milliseconds to run to completion. If the first queue has a time quantum of 10 milliseconds and each queue thereafter has a time quantum that is twice as large as the previous one, explain how many times the job will be interrupted and on which queue will it finish its execution. (2 marks) B