If a resource allocation graph contains a cycle and there is several instances per resource type, then O a. There is a deadlock O b. There is no deadlock OC. There is a possibility of a deadlock O d. Resources cannot have more than one instance O e. None of the above