Task $4$: Which scheduling algorithm has minimum waiting time?

$[20]$

Consider the following set of processes with their arrival time and the CPU burst time $($in milliseconds$)$

$\backslash$table$[[$Process ID$,$Arrival Time,Burst Time $($ms$)],[$P$1,0,11],[$P$2,5,3],[$P$3,1,7],[$P$4,6,4],[$P$5,8,5]]$

Calculate the average turn around time and average waiting time if CPU scheduling policy is:

a$)$ is FCFS

b$)$ Non$-$pre$-$emptive FSJ

c$)$ Pre$-$emptive FSJ$.$

d$)$ Non$-$preemptive priority with the following priorities for $2,0,3,1,4$ for P$1,$ P$2,$ P$3,$ P$4,$ and P$5,$ respectively. $0$ is the highest priority.

e$)$ Pre$-$emptive priority

f$)$ Round$-$Robin with quantum time of $3ms.$