The wait-for graph is a deadlock detection algorithm that is applicable when ____________
(a) all resources have a single instance
(b) all resources have multiple instances
(c) all resources have a single 7 multiple instances
(d) all of the mentioned