Problem: Consider the following snapshot of a system:
P0, P1, P2, P3, P4 with ABC- Allocation: P0=(0,1,0), P1,=(2,0,0), P2=(3,0,2), P3=(2,1,1), P4=(0,0,2) - Maximum: P0=(7,5,3), P1=(3,2,2), P2=(9,0,2), P3=(2,2,2) P4=(4,3,3) - Available (3,3,2)
Answer the following questions using the banker's algorithm:
1. What is the content of the matrix Need?
2. Is the system in a safe state?
3. If a request from process P0 arrives for (1, 3 ,0), can the request be granted immediately?