Consider the following snapshot of a system: Allocation Max Available ABCD 1 013 011 ABC D 5 5 1 6 A BCD 3 20 Po P2 P3 P4 1 0 0 4 3 24 4 5 22 Answer the following questions usin a. Show the content of the matrix Need below g the banker's algorithm: Need A BC 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 witho producing a deadlock. Otherwise show the order in which the largest number of processes can be executed before an unsafe state is reached