Given 4 processes PO to P3 and 3 resource types: A (7 instances), B (3 instances), and C (5 instances). Suppose a snapshot taken for the system at time T, as follows: Allocation ABC Max ABC Available A B C Po 200 4 1 2 111 Pi 1 0 1 1 1 2 ZA P2 3 1 1 4 3 1 P3 0 1 2 3 2 4 A- Apply Banker's algorithm to determine if the system is in a SAFE or UNSAFE state? Note: show all the changes made to the available resources (work). B- If the system is safe what is the execution sequence of processes that aveids deadlock! lifunsafe just write NONE) cesvold deadlock can a reguest for resources (1 2.0) by P2 de granted? why