For single unit resources, we can model resource allocation and requests as a directed
graph connecting processes and resources. Given such a graph, what is involved in deadlock
detection
Answer:
-We detect deadlocks by finding closed loops in the graph, where two or more processes requesting resources are held by other processes