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
Occurrence: 0, System Administrator 2026