Q. The wait-for graph is a deadlock detection algorithm that is applicable when (Solved)
1. all resources have a single instance
2. all resources have multiple instances
3. all resources have a single 7 multiple instances
4. all of the mentioned
- a. all resources have a single instance