There are multiple copies of resources are available in a system. A process can request for more than one copy of a resource. Suppose a process will be blocked till at least one copy of resource is granted, what is the sufficient condition to detect a deadlock from wait for graph of the system?
a) A cycle is present in WFG.
b) A knot is present in WFG.
c) Both a and b can be the conditions and equally powerful.
d) Both a and b can be failed in given conditions in problem