Consider the following snapshot of a system: allocation max available a b c d a b c d a b c d p0 2 0 0 1 4 2 1 2 3 3 2 1 p1 3 1 2 1 5 2 5 2 p2 2 1 0 3 2 3 1 6 p3 1 3 1 2 1 4 2 4 p4 1 4 3 2 3 6 6 5 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 p1 arrives for (1, 1, 0, 0), can the request be granted immediately?
c. if a request from process p4 arrives for (0, 0, 2, 0), can the request be granted immediately?