5) Answer the following questions Process Burst Time Priority (a) Consider the set of processes shown in the table above, with the length of the CPU-burst time given in milliseconds. The processes are assumed to have arrived in the order P, P2 ,Ps, P, and Ps, all approximately at time 0. Draw two Gantt charts illustrating the execution of these processes using round-robin (quantum size 5), a non-preemptive priority (a smaller priority number implies a higher priority) scheduling. Calculate average waiting time for both scheduling. What is convoy effect? ) Choosing a correct quantum size is important for efficient operation of the round-robin based CPU scheduling. How do you select quantum size in an academic computing environment where most jobs are students' programs