Available
ABCD
1 5 2 0
Allocation
Max
process
A B C D
A B C D
PO 0 0 1 2 0 0 1 2
P1 1 0 5 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 4 5 5
Need
A B C D
0 0 0 0
0 7 5 0
1 0 0 2
0 0 2 0
0 4 4 1
Answer the following question using the banker's algorithm, if a request from process P1 arrives
for (0,4,2,0), and the request is granted immediately, what would be the safe sequence?
None of these.a
PO, P3, P2, P1, and P4.b
PO, P1, P3, P2, and P4.c
PO, P4, P3, P1, and P2.d