Need assistance with the following question specially question 3.3 please

3.3. Assuming Tables 2, 3, 4, and 5 as the current execution state of the following processes in terms of resource allocation. There are five processes (1, ..., 5) and three resources (A, B, and C). Given the following tables, determine if the current state of the execution is a SAFE STATE. Given the request table, will this system be in deadlock, inevitably? Explain and show through Banker's Algorithm. [8] Table 2:Allocation matrix Table 3: Request matrix ABC ABC pl 0 1 0 p2 2 0 0 p3 3 0 2 p4 21 1 p5 0 0 2 pl 7 4 3 p2 2 2 p3 6 0 0 p4 0 1 1 p5 43 1 Table 4: Ree vector ABC Table 5:Available vector ABC 10 5 7 3.4. For the same scenario as in part (vii), assume Tables 6, 7, 8, and 9 as allocations and requests over multiple type resources. Determine/detect and show if the current execution is in deadlock. [8 Table 6: Allocation matrix Table 7: Request matrix ABC ABC pl 0 1 0 p2 2 0 0 p3 3 0 2 p4 21 1 p5 3 0 2 pl 7 4 3 p2 2 2 p3 6 0 0 p4 0 1 1 p5 3 1 Table 8:Resource vector ABC 10 5 7 Table 9: Available vector ABC 0 32