Consider the following set of processes, arriving at the given times and having the following CPU burst time and priorities: Draw a Gantt chart and calculate average waiting time and turn-around time of each process using SJF, Priority and Round Robin (quantum 3 ms) CPU scheduling algorithms. Assume pre-emptive scheduling policy for SJF and Priority scheduling. Consider higher the priority value, lower the priority of the proces

Process Arrival Burst Time Priority Time(ms) (ms) 3 1 A B D 0 3 5 8 8 4 7 3 4 2