Exercise: Evaluate Round Robin (RR) and Multilevel Feedback Queues (MFQ) non-preemptive scheduling algorithms for the following five processes:

Process	CPU burst time	Arrival time
P1	10	0
P2	12	3
P3	4	7
P4	6	11
P5	3	19

For RR scheduling, use quantum is T_q=5. For MFQ scheduling, every process enters the first queue. There are 3 queues each using RR scheduling, with time quantum 4, 6, and 8, respectively.

a. Show the timing diagrams of process execution for both algorithms. Indicate when each process arrived, completed, or entered the next queue (in the case of MFQ scheduling).

b. Calculate waiting and turnaround times (Tw and Ttr) for all processes and their average times.