Please do all the parts $1-4$ and the end part as well

Five processes, A 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

Draw a Gantt chart for each scheduling algorithm from the

previous question.

Using the previous five processes from question $1,$ perform

round$-$robin scheduling with the following quanta. When

the quantum becomes as large as the largest burst time

among processes, what scheduling algorithm does round$-$

robin begin to resemble?

a$.$ Round$-$robin, with a quantum of $4$ milliseconds

b$.$ Round$-$robin, with a quantum of $6$ milliseconds

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

d$.$ Round$-$robin, with a quantum of $10$ milliseconds

Hint: If a process finishes its work before the quantum is

up$,$ the next process in the queue can run right away!

Given four processes P $1$ to P $4$ and one each of six different

resource types R$1$ to R$6,$ the following processes are

currently allocated the following resources:

a$.$ P$1$: R$1,$ R$2$

b$.$ P$2$: R$3$

c$.$ P$3$: R$4,$ R$5$

d$.$ P$4$: R$6$

The following processes are requesting the following

resources:

a$.$ P$1$: R$3$

b$.$ P$2$: R$1,$ R$4$

c$.$ P$3$: R$2$

d$.$ P$4$: R$5$

Is this deadlocked? Draw a graph to show your work.

Given four processes P$1$ to P$4$ and one each of six different

resource types R$1$ to R$6,$ the following processes are

currently allocated the following resources:

a$.$ P$1$: R$1$

b$.$ P$2$: R$2,$ R$3$

c$.$ P$3$: R$4$

d$.$ P$4$: none

The following processes are requesting the following

resources:

e$.$ P$1$: R$2$

f$.$ P$2$: R$4$

g$.$ P$3$: R$5$

h$.$ P$4$: R$1,$ R$3,$ R$6$

Is this deadlocked? Draw a graph to show your work.