please solve fast will give you vote up all of us if you solve it

Consider the following snapshot of a system: Available ABCD 1 2 1 2 P1 P2 P3 P4 P5 Allocation A B C D 3 1 1 1 1 4 2 0 1 2 2 1 0 1 0 1 1 2 1 2 A 4 1 1 2 3 MAX B C 3 3 4 3 3 6 1 1 3 2 D 3 2 2 4 5 Answer the following questions using the banker's algorithm based on the above figure: a. Find the Need Matrix and write it in the following format: P1 (A, B, C, D) P2 (A, B, C, D) P3 (A, B, C, D) P4 (A, B, C, D) P5 (A, B, C, D) b. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete (i.e. find a safe state). c. If a request from process P2 arrives for (0, 1, 1, 1), can the request be granted immediately? Why? Show you detailed answer. (The mark depends on your detailed answer only) d. If a request from process P3 arrives for (0, 2, 0, 0), can the request be granted immediately? Why? (The mark depends on your answer to the "why question)