An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of four resource types A, B, C and D to four processes P1, P2, P3 and P4. Resource type A has 7 instances, B has 5 instances, type C has 4 instances and type D has 3 instances. The table given below presents the current system state. Here, the allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution. Answer the following questions considering the above case study: 1. Understand the process allocation in the given case study and test the Safety algorithm to show the statues of the system in term of deadlock. [10 marks, 1 mark for each step] 2. Consider the following independent requests for additional resources in the current state: [8 marks, 4 marks for each request] REQ1: PO requests 1 units of A, units of B,1 units of C and units of D REQ2: P1 requests units of A, units of B,1 units of C and 1 units of D Examine the safe state of the system in case of serving REQ1 and REQ2, independently