Draw the gantt charts for $1)$ FCFS $2)$ Priority $($Non$-$Preemptive$)3)$ Round Robin $($ Time Quantum$=2).$ Also calculate the average waiting times for all the above scheduling algorithms. And lastly tell which of the algorithms results in minimum average waiting time$($in milliseconds$)?$

Note : $(1$ has the highest priority and so on$)$