Exercise 1: Consider the following set of processes: a- Draw 2 Gantt charts to illustrate how these processes would be scheduled using SJF, FCFS. b- Calculate the obtained average waiting time for each algorithm. Exercise 2: Consider below table of four processes under Multi-level queue scheduling. Queue number denotes the queue of the process. Note that priority of queue 1 is greater than queue 2 . a- Draw a Gantt chart to illustrate how these processes would be scheduled if Queue 1 uses Round Robin (Time Quantum =7 ) and Queue 2 uses FCFS. Note that a task with the highest priority can interrupt the execution of task with a lower priority. b- Calculate the waiting time for each process c- Calculate the average waiting time