Solve the deadlock problem (Banker’s Algorithm) provided below:
| Process | Allocation | Max | Available |
| P0 P1 P2 P3 P4 |
A B C D 0 0 1 2 1 0 0 0 1 3 5 4 0 6 3 2 0 0 1 4 |
A B C D 0 0 1 2 1 7 5 0 2 3 5 6 0 6 5 2 0 6 5 6 |
A B C D 1 5 2 0 |
Answer the following questions using the Banker’s Algorithm
- What will be the contents of matrix Need?
- Draw the safe sequence?
- If the request from P1 arrives for (0, 4, 2, 0), can the request be granted immediately?
