Q23) (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) 

• Process A holds nothing, wants resource X and Y

• Process B holds resource X, wants resource Y and Z

• Process C holds resource Y and Z, wants resource X

• Process D holds resource T and K, wants resource Z

• Process E holds resource L, wants resource T

• Process F holds nothing, wants resource L

b) 

• Process A holds nothing,  wants resource X and Y

• Process B holds resource X, wants resource Y and Z

• Process C holds resource Y and Z, wants resource T

• Process D holds resource T and K, wants resource L

• Process E holds nothing, wants resource T and K

• Process F holds resource L, wants nothing