these questions are related to operating system can you answer both

q1

q2

What is the wait-for graph? How it is used to detect deadlock? Explain your answer with an example Consider banker's algorithm for deadlock avoidance with five (PO to P4) processes and 3 resource types A, B and C with maximum available instances for each type as follows: A (10 instances), B (5instances), and C (7 instances) Assume following is the system resources snapshot: Available ABC 230 Po P1 P2 P3 P4 Allocation ABC 010 302 302 211 002 Need ABC 743 020 600 011 431 a: Explain whether system is in safe state or not at this point, justify your answer. b: Can request for (3,3,0) by P4 be granted? C:Can request for (0,2,0) by Po be granted