Consider the following snapshot of a system running n processes. Process i is holding xi instarices of a resource R for 1j = minkp,qyk b)

Consider the following snapshot of a system running n processes. Process i is holding xi instarices of a resource R for 1j<=n Currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional y, instances while holding the x instances it already has. There are exactly two processes p and q such that yp = y = 0. Which of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

a) min(Xp, Xq) < maxkp.qyk

b) Xp + Xq >= minkp,qyk

b) min(Xp, Xq) <1

c) min (Xp, Xq) >1