Mаrk True оr Fаlse fоr eаch statement belоw. 1. Deadlock requires mutual exclusion, hold and wait, no preemption, and circular wait conditions to occur. [1] 2. Preemptible resources, such as RAM, can be released mid-use without causing contention. [2] 3. A Holt Graph is ineffective for modeling and detecting deadlocks in small resource allocation scenarios. [3] 4. Depth-First Traversal is the most efficient method to detect cycles in a graph for deadlock detection. [4] 5. The "Ostrich" approach to deadlock management involves intentionally ignoring potential deadlocks because addressing them may not be worth the effort. [5]