Draw a Gant chart for the following scheduling algorithms and compute the Average Waiting Time.

1.FCFS

2.SJF

3.Priority based scheduling

4.Multi level feedback queue

CPU Scheduling Practice Assume that there are three processes P1, P2, and P3 respectively submitted at times 2, 3, and 9. The CPU scheduler is invoked the first time at time 3 after completing a previous process (other than P1, P2, or P3). The three processes P1, P2, and P3 require respectively 12, 5, and 7 units of time. We assume that 1) the CPU scheduler allows preemption; 2) context switch takes one time unit when a process is preempted by another process; 3) no context switch if a process terminates normally; and 4) the context switch is negligible if a process is just loaded, not preempted. Hint: the waiting time of each process can be calculated using the following equation