Answer needed asap of all parts in hand written

Topic: Banker's Algorithm Assume that there are 5 processes, Po through P4, and 4 types of resources. At To we have the following system state: Allocation Max Available B D B D A B C D 0 1 1 0 0 2 1 0 1 5 2 0 P1 1 2 3 1 1 6 5 2 P2 1 3 5 2 3 6 6 09 6 3 P3 0 6 3 2 0 6 01 5 2. PA 0 0 1 4 0 6 5 6 Q1: Create Need Matrix? Q2: Identify two safe states? Q3? Run the algorithm for the system if P1 comes up with a request (2, 1, 1, 0)