Consider the following snapshot of a system: Allocation Max Available A B C D E A B C D E A B C D E P0 2 0 0 1 0 4 2 1 2 3 3 3 3 1 2 P1 0 1 2 1 1 3 2 5 2 3 P2 2 1 0 3 1 2 3 1 6 3 P3 1 3 1 2 2 1 4 2 4 4 P4 1 4 3 2 2 3 6 6 5 4

Answer the following questions using the bankers 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, 1), can the request be granted immediately? c. If a request from process P4 arrives for (0, 0, 2, 0, 1), can the request be granted immediately?