Consider a set of $5$ processes whose arrival time $($in milliseconds$),$ CPU burst time $($in milliseconds$),$ and the priority are given below:

Draw three Gantt Charts that illustrate the execution of these processes and then calculate average turnaround time, average waiting time, and average response time using the following scheduling algorithms:

a$.$ SJF $($preemptive$)$

b$.$ Priority $($preemptive$)$

c$.$ Round Robin $($time quantum $=2)$