$(12\%$ Consider the following processes, with the length of the CPU$\_$burst time given in microseconds $($ s$).$

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

The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5$ at time $0.$

A$.$ The waiting times for $Pl$ are $$ s for FCFS$,$ for $$ s for $SJF,$ for non$-$preemptive scheduling $($a smaller priority number implies a higher priority$),$ and is for quantum $=1s.$

B$.$ The turnaround times for P$1$ are $$ sor FCFS$,$ s for SJF$,$ for non$-$preemptive scheduling $($a smaller priority number implies a higher priority$),$ and is for quantum $=1s.$

C$.$ The average waiting times are $$ s for FCFS$,$ s for SJF$,$ for non$-$preemptive scheduling $($a smaller priority number implies a higher priority$),$ and $$ s for quantum $=1s.$