please answer and provide explination, thank you!

Consider the following snapshot of a system: Allocatiorn Max Available A B CD PO 1 0 1 3 Pi 01 11 P2 1 11 1 A B C D 5 5 1 6 22 1 2 4 3 2 4 4 5 2 2 A B C D 3 2 0 1 P3 P4 10 0 1 Answer the following questions using the banker's algorithm: a. Show the content of the matrix Need below. Need A B C D PO P1 P2 P3 P4 Show that the system in a safe state by listing the order in which processes can be executed without producing a deadlock. b. c. If a request from process Po arrives for (2, 2, 0, 0), can the request be granted immediately? If yes, then list the order in which processes can be executed without producing a deadlock. Otherwise show the order in which the largest number of processes can be executed before an unsafe state is reached