Please solve with full explaination:

Five batch jobs A through E$,$ arrive at a computer center at almost the same time. They have estimated running times of $10,4,2,6,$ and $8$ minutes. Their $($externally determined$)$ priorities are $3,5,4,2,$ and $1,$ respectively, with $5$ being the highest priority. For each of the following scheduling algorithms, determine the average process turnaround time. Ignore process switching overhead.

$($a$)$ Round robin $($assuming the quantum is small, e$.$g$.,10$ ms$,$ so that when n processes running, each process will get a fair share of $1/$n of the CPU time$).$

$($b$)$ Priority scheduling.

$($c$)$ First$-$come, first$-$served $($run in order $10,4,2,6,8).$

$($d$)$ Shortest job first.

For $($a$),$ assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For $($b$)$ through $($d$)$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.