a) By referring to the information given in the table below, discuss Round Robin scheduling algorithm. (3 marks) Process Burst time (milliseconds) 15 P1 P2 33 P3 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) ii. 10 milliseconds