$(10$ points$)($Based on$,$ Practice exercise $6\mathrm{.}17$ Operating system concepts Edition $10,$ not your current text$)$: A variation of the round robin scheduling algorithm is a preemptive round robin. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed there is an "idle" process with a priority of zero that is only scheduled where no other processes are available. The time quantum is $10$ "units" of time. If a higher priority process arrives in the system, it preempts a lower priority process that is executing. A preempted process is placed back into the ready queue

$\backslash$table$[[$Process$/$thread$,$Priority,Burst Duration,Arrival time$],[$P$1,10,25,0],[$P$2,10,25,10],[$P$3,10,20,15],[$P$4,35,5,20],[$P$5,5,10,20],[$P$6,20,10,25]]$