device is available and it operates in a Shortest Job First $($SJF$)$ manner. Ignore the switching time for the I$/$O

device. Draw the Gantt charts for the CPU and I$/$O devices and compute the waiting times, turnaround

times, and CPU utilization if the CPU is scheduled using a Round Robin algorithm with the time quantum $5$

msec and context switch time $2$ msec.

A complete and step$-$by$-$step explanation of the solution is required!

Q$2)$ Consider a computer system involving $4$ processes $(P1,P2,P3,P4$ and $5$ different types of resources

$(R1,R2,R3,R4,R5).$ Assume that $2$ instances of $R1,1$ instance of R$2,1$ instance of $R3,2$ instances of $R4,$ and

$1$ instance of $R5$ exist.

a$)$ Fill in the max and available vector.

b$)$ Apply the deadlock detection algorithm to show whether there is a deadlock or not. Clearly show

the applied steps and do the necessary explanations.