Q18) (Deadlock Detection) Draw the resource allocation graphs for the following process-resource interactions and state whether there is a deadlock or not. (Give the potential resources and processes involved if that is the case). If there are no possible deadlocks, state a possible order of execution. a) 1. Process A holds nothing, wants resource X and Y Process B holds resource X, wants resource Y and Z 3. Process C holds resource Y and Z, wants resource X 4. Process D holds resource T and K, wants resource Z 5. Process E holds resource L, wants resource T 6. Process F holds nothing, wants resource L 2. b) 1. Process A holds nothing, wants resource X and Y 2. Process B holds resource X, wants resource Y and Z 3. Process C holds resource Y and Z, wants resource T 4. Process D holds resource T and K, wants resource L 5. Process E holds nothing, wants resource T and K 6. Process F holds resource L, wants nothing