For below Processes table, calculate the average waiting time for the algorithms: First Come First Serve $($FCFS$)$

Shortest Job First $($SJF$)$ and

Priority Scheduling

Process Burst Time Priority

PI $103$

P$211$

P$324$

P$415$

P$552$

$(3$b$)$ List the four conditions that must hold simultaneously in a system for deadlock to arise.

$(3$c$)$ In the following resource allocation graph, is the state a deadlocked one? If so which ones are deadlocked? Resource allocation graph.

R$,=$ Resource, P $=$ process.

R$1$R$3$PPPR$3$