2. What is critical section problem? Wrat die ting where four queues are present. Queue 1 takes 3. Consider multilevel queue scheduling where four queues are present. Queue 1 takes processes with priority values 1 tal Queue 3 takes processes with priority values 13-20 and Queue 4 takes rest of the round robin scheduling wit time quantum 5. Queue 3 and 4 use FCFS. Draw the Gantt chart and calculate average waiting time for the processes shown in the following table. 10 Draw the Gantt chart and calculate average waiting time using shortest remaining time first scheduling. Use the same table. 7 Use this table for both Q4 and Q5