(operating system )

Please solve by expert and make it quick as soon as possible

There several methods in deadlock avoidance employ by current modern operating system. One of them is the used of Banker algorithm. Please analyze the below initial state in Figure 4 and find either deadlock will occur or not. Show all available state while using the Banker algorithm and state why if deadlock occur or not. P1 P1 P2 P3 R1 R2 R3 R4 4 2 2 2 1 0 2 o 2 3 5 Claim Matric C | | NN R1 2 1 o R2 R3 R4 2 1 o o 0 1 1 2 4 R1 2 1 R2 R3 R4 1 1 o 0 P1 P2 P3 P2 1 1 P3 o 1 1 1 Allocation Matric A C-A R1 R2 R3 R4 R1 R2 R3 2 1 1 R4 0 5 4 4 5 Resource Vector R Available Vector V Figure 4: Initial state