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

Round robin

Priority scheduling

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

Shortest job first.

For $(1)$ assume the system is multi$-$programmed, and that each job gets its fair share of the CPU $($ quantum time is: $4$ ms$).$ Question $1$ is preemptive.

For $(2)$ through $(4)$ assume that only one job at a time runs until it finishes. All jobs are completely CPU$-$bound. Questions $2-4$ are non$-$preemptive.