Consider a system with three processes P1, P2, P3, and P4. There are types of serially reusable resources R1, R2, and R3 with 3, 2, and 2 instances. Process P1 holds 1 instance of R1 and requests 1 instance of R2. Process P2 holds 2 instances of R2 and requests 1 instance each of R1 and R3. Process P3 holds 1 instance of R1 and requests 1 instance of R2. Process P4 holds 2 instances of R3 and requests 1 instance of R1. Q2: Draw the resource allocation graph of this system. Does the graph illustrate a deadlock or not, please explain your answer in detail.