Consider a distributed system consisting of n processes and mresources in which processes are using OR request model to submitresource requests. Prove or disprove: the RAG (resource allocationgraph) can contain at most min{ n/2, m/2} distinct deadlocks.
Expert Answer
An answer will be send to you shortly. . . . .