Write Bankers safety algorithm with the explanation of each step? Consider the table given below for a system, find the need matrix and the safety sequence (if possible), is the request from process P1(2, 1, 2) can be granted immediately. Given:

Process Allocation Maximum Available B A B A B C P1 0 1 0 6 4 5 2 2 P2 2 0 0 3 2 2 P3 3 0 2 9 4 2 P4 2 1 1 2 2 2 P5 0 0 2 4 3 3