A system has resource types A, B, C with total units (10, 5, 7) and Available (3, 3, 2). Allocation and Max matrices are: P0 Alloc(0,1,0) Max(7,5,3); P1 Alloc(2,0,0) Max(3,2,2); P2 Alloc(3,0,2) Max(9,0,2); P3 Alloc(2,1,1) Max(2,2,2); P4 Alloc(0,0,2) Max(4,3,3). Using the Banker's Algorithm, which of the following is a valid safe sequence?

Need = Max − Allocation: P0(7,4,3), P1(1,2,2), P2(6,0,0), P3(0,1,1), P4(4,3,1). Starting Available=(3,3,2): P1's Need(1,2,2) ≤ Available, so run P1, releasing (2,0,0) → Available=(5,3,2). Next P3's Need(0,1,1) ≤ Available, run P3, releasing (2,1,1) → Available=(7,4,3). Next P4's Need(4,3,1) ≤ Available, run P4, releasing (0,0,2) → Available=(7,4,5). Next P0's Need(7,4,3) ≤ Available, run P0, releasing (0,1,0) → Available=(7,5,5). Finally P2's Need(6,0,0) ≤ Available, run P2. The sequence P1, P3, P4, P0, P2 is safe, matching option C.