Q#4 Solve the following bankers Algorithm and find a save sequence 5 processes P0 P1 P2 P3 P4; 3 resource types A (20 instances), B (10 instances), and C (14 instances). Snapshot at time T0:

Allocation Max Available

A B C A B C A B C

P₀ 0 2 0 14 10 3 6 6 4

P₁ 4 0 0 6 4 4

P₂ 6 0 4 18 0 4

P₃ 4 2 2 4 4 4

P₄ 0 0 4 8 6 6