1. There are five active processes P1, P2, P3, P4 and P5 given below. Apply multilevel queue scheduling (MQS) consisting of two queries (Queue 1 has absolute higher priority over queue 2). Processes DO NOT change queues. NOTE: this is not MLFQ.

Process	CPU burst time	Arrival time	Priority queue
P1	12	0	2
P2	7	3	1
P3	9	6	2
P4	9	12	2
P5	4	13	1

Both queues use round robin scheduling, with TQ1=5 (Priority queue 1) and Tq2=4(Priority queue 2).

Show the gantt chart and calculate individual and average waiting time, individual and average response time and individual and average turnaround time.

2. Consider this set of processes. Construct gantt charts for scheduling algorithms indicated below and compute the individual and average waiting time, individual and average response time and individual and average turnaround time for each algorithm. FCFS (non preemptive), SJF(non preemptive), and RR(TQ 4):

Process	Arrival time	Burst time
P1	0	10
P2	2	8
P3	5	14
P4	7	6
P5	9	7
		AVERAGE

Provide Gantt charts and results for all three algorithms