Please I need to complete this page urgently, I hope that the line is clear so that I can understand the solution

Example: P1 Request (1,0,2) First, we Check that Request | Available (that is, (1,0,2) 0 (3,3,2) true) Allocation Need Available ABC ABC ABC PO 010 743 23 0 P1 302 020 P2 302 600 P3 211 011 P4002 431 Avale ABC 332 Akacao Mar ABC ABC A 010 753 A 200 322 A 302 902 A 211 222 R 002 433 Second, We must determine whether this new system state is safe. So, we execute our safety algorithm and find that the sequence satisfies the safety requirement. Can request for (3,3,0) by P4 be granted? no (2,3,0) = (3,3,0)