Plz show all work

Consider the following snapshot of a system: Allocation ABCDE Available ABCDE 333 12 P0 20010 P 01211 P2 21031 P3 13122 P4 143 22 Max ABCDE 42123 3 2523 23163 14244 36654 Answer the following questions using the banker's algorithm: Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete If a request from process Pl arrives for (1, 1, 0, 0, 1), can the request be granted immediately? If a request from process P4 arrives for (0, 0, 2, 0, 1), can the request be granted immediately? a. b. c