Given a system with 4 processes and resources R1(3 instances), R2(2), R3(2): Allocation: P1(1,0,0), P2(0,1,0), P3(1,1,1), P4(0,0,1). Request: P1(0,1,0), P2(1,0,0), P3(0,0,1), P4(1,1,0). Available: (1,0,0). (1) Draw resource allocation graph, (2) Is there a deadlock? Use Banker's algorithm to check, (3) If deadlocked, which processes? How to recover? (4) Show safe sequence if one exists.
