Consider the following state in Banker's algorithm: Resources A B C D 6 4 7. 6 Claim Allocated A B C D A B C D P1 3 3 2 2 P1 | 12 21 P2 1 2 3 4 P2 1 0 3 3 P3 1 1 50 P3 | 11 1 0 Are we in a safe state? If yes, provide the sequence of execution of processes with the available value of resource B after each step. Select one: a. yes P1 then P2 then P3 resource B: 1,3,3,4 b. yes P2 then P1 then P3 resource B: 6, 4, 7,6 . no d. yes P1 then P2 then P3 resource B: 3, 1, 1, 2