Use the shortest Job remaining next $($SJRN$)$ and Round Robin scheduling algorithm to calculate average waiting time and turn$-$around time of the processes given below.

$\backslash$table$[[$Process$,$Burst Time,Arrival Time,Priority$],[$P$1,7,3,4],[$P$2,4,1,3],[$P$3,12,4,2],[$P$4,5,3,1],[$P$5,9,3,]]$

Note: Round robin scheduling algorithm uses the time quantum as $3$ units