Q. The wait-for graph is a deadlock detection algorithm that is applicable when

• all resources have a single instance
• all resources have a multiple instances
• all resources have a single 7 multiple instances
• all of the mentioned

Submit