$1.$ Five processes, $\backslash ($ A $\backslash )$ through E$,$ arrive at a CPU core one after the other at around the same time, with the following runtimes and priority levels $($larger numbers are higher priority$)$:

a$.$ A: $10$ milliseconds, priority $3$

b$.$ B: $6$ milliseconds, priority $5$

c$.$ C: $2$ milliseconds, priority $2$

d$.$ D: $4$ milliseconds, priority $1$

e$.$ E: $8$ milliseconds, priority $4$

For each of the following scheduling algorithms, determine the average waiting time and turnaround time. Turnaround time is the amount of time between when a process is first submitted to a CPU to when it finishes running. $($This is adapted from chapter $2$ problem $45$ from the textbook.$)$

a$.$ First$-$come$-$first$-$served

b$.$ Shortest$-$job$-$first

c$.$ Round$-$robin, with a quantum of $2$ milliseconds

d$.$ Priority scheduling

$2.$ Draw a Gantt chart for each scheduling algorithm from the previous question.