Five jobs, A through E$,$ arrive at a computing center in about the same amount of time. The next table shows the arrival time of each process, its estimated execution time and its priority. The highest priority is $5.$

For each of the following scheduling algorithms determine the average processing cycle time. You ignore the overhead of switching processes.

$($a$)$ Round robin service with a quantum of time of your choosing

$($b$)$ Service on a first$-$come, first$-$served basis

$($c$)$ Priority Service