| process |
current allocated |
maximun allocation |
remainig need=current-max allocation |
| p 1 |
1 |
3 |
2 |
| p 2 |
1 |
2 |
1 |
| p 3 |
3 |
9 |
6 |
| p 4 |
2 |
7 |
5 |
reamaining need= current -demand(Max allocation)
now suppose if we have only 2 available resource than we can satisfy the need of process p 1 or p 2 if we first satisfy the need of process p 1 than according to resource allocation policy all the allocated resource will be given back hence now we have 3 available resource , now we can we can satisfy the need of process p 2 and after that we have now 4 available resource ,
if we look in need column than process p 3 and p 5 can't be satisfed its, therefore whole system is not safe hence, deadlock occur option ( b) cannot be the answer.
now again repeat the above whole procedure with three(3) available resource,
therefore option (C) will be the answer..
