Consider the following snapshot of a system Allocation Max Available A B C D 1 4 1 4 A BC D A BC D PO 1 0 0 0 P1 1 1 0 1 P2 1 1 0 1 P3 1 0 1 0 P4 01 1 0 4 2 4 1 Answer the following questions using the banker's algorithm: a Show the content of the matrix Need below Need A BC D PO P1 P2 P3 P4 b Show that the system in a safe state by listing the order in which processes can be executed without producing a deadlock If a request from process Pi arrives for (1, 0, 0, 0), can the request be granted immediately? Show the updated NEED and Allocation matrices. Ifyes, show the safe sequence. If no, list the processes that are possibly in a deadlock c