Consider CPU is preemptive.

$1.$

$\backslash$table$[[$Process$,$Burst Time,Priority,Arrival Time$],[$P$1,10,3,0],[$P$2,1,1,3],[$P$3,2,5,2],[$P$4,1,4,2],[$P$5,5,2,1]]$

For the set of processes directly above, draw a Gantt chart for the Scheduling Algorithm. Priority$->$Arrival Time$->$FCFS

For the set of processes directly above, calculate the average wait time.

For the set of processes directly above, calculate the average turnaround time.

For the set of processes directly above, calculate the average response time.

$2.$ Quantum $=2,$ Apply the round$-$robin algorithm

$\backslash$table$[[$Process$,$Burst Time,Arrival Time$],[$P$1,10,0],[$P$2,3,1],[$P$3,2,2],[$P$4,3,3],[$P$5,5,4]]$

For the set of processes directly above, calculate the average wait time.

For the set of processes directly above, calculate the average turnaround time.

For the set of processes directly above, calculate the average response time.