Consider the following snapshot of a system:

Allocation Max Available Need

A B C D A B C D A B C D

P$0200142123321$

P$131215252$

P$221032316$

P$313121424$

P$414323665$

Answer the following questions using the banker$$s algorithm:

a$.$ Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.

b$.$ If a request from process P$1$ arrives for $(1,1,0,0),$ can the request be granted immediately?

c$.$ If a request from process P$4$ arrives for $(0,0,2,0),$ can the request be granted immediately?

Please I need specific answer without a lot of explintion