$3\mathrm{.}1$ The table below shows jobs submitted $($almost simultaneously$)$ in order: P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ for execution in a computer system with Time$-$

sharing Capability

$3\mathrm{.}1\mathrm{.}1$ Using a$)$ First$-$Come$-$First$-$Served $($FCFS$)$ scheduling algorithm and b$)$ Shortest Job Next SJN $($Shortest Job First$)$ scheduling, calculate the

average turnaround time for all the jobs.$[20]$