Which of the following is correct with respect to the resource allocation graph? If the graph contains no cycles with many resource instances then DEADLOCK If the graph contains cycles with many resource instances then DEADLOCK If the graph contains no cycles with one resource instance then DEADLOCK If the graph contains cycles with one resource instance then DEADLOCK occurs when a process may never be removed from the semaphore queue in which it is suspended: O Priority inversion O Indefinite blocking 0 Spinlock 0 Deadlock ensures that a system will never enter an unsafe state: O Deadlock recovery O Deadlock detection O Deadlock prevention O Deadlock avoidance