i need the answers ASAP

Case study: An operating system uses the Bankers algorithm for deadlock avoidance when managing the al- location of four resource types A, B, C and D to five processes P1, P2, P3, P4 and P5. Resource type A has 7 instances, B has 4 instances, type C has 3 instances and type D has 2 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 maxi- mum number of resources of each type required by each process during its execution. Processes Max Allocation Available A B D A B D A B D P1 2 1 0 1 0 0 1 1 0 1 0 P2 1 1 1 0 1 0 0 P3 4 1 1 1 3 1 1 P4 0 2 0 2 0 1 0 0 P5 4 2 1 0 2 1 1 O Answer the following questions considering the above case study: 1. What will be the content of the Need matrix? 2. Apply the Safety algorithm on the given case study and provide the results. independent requests for additional resources 3. Consider the following current state: in the REQ1: P1 requests 1 units of A, 0 units of B, 1 units of C and units of D REQ2: P2 requests o units of A, 0 units of B, 1 units of C and 1 units of D Discuss the safe state of the system in case of serving REQ1 and REQ2, independently. 4. Draw the resource- allocation graph for the given system by analyzing the above table. 5. Develop a program to avoid the deadlock in the given system using Banker's Algorithm