$14.$ Consider the set of $5$ processes whose arrival, burst times and priorities are given below:

$\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|\}$

$\backslash$hline Process Id & Arrival time & Burst time & Priority $\backslash \backslash$

$\backslash$hline P$1$ & $0$ & $4$ & $2\backslash \backslash$

$\backslash$hline P$2$ & $1$ & $3$ & $3\backslash \backslash$

$\backslash$hline P$3$ & $2$ & $1$ & $4\backslash \backslash$

$\backslash$hline P$4$ & $3$ & $5$ & $5\backslash \backslash$

$\backslash$hline P$5$ & $4$ & $2$ & $5\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$

Calculate the average waiting turnaround times in the case of:

$1.$ Preemptive Priority scheduling algorithm.

$2.$ Non$-$preemptive priority scheduling algorithm.