A deadlock exists in a system if and only if the wait for graph

• A. has a cycle in it
• B. has a path from first node to last node
• C. is a tree
• D. has a layout in it