Gven the following state for the Banker's Algorithmm 6 processes PO through P5 4 resource types: A (15 instances; B (6 instances) C (9 instances), D (10 instances) Snapshot at time TO Maximum demand Process A B C D Current allocation Process AC D PO P1 P2 P3 P4 P5 P1 P2 P3 2 2 3 3 3 3 3 2 P4 5 2 21 PS 410 2 100 1 10 0 4 4 44 c Show that the current state is safe, that is show a safe sequence of processes. In addition to the sequence show how the Available (wrking array) changes as each process terminates Choose from processes that could run to completion in this order: PO, P1, P2, ..P5 in a round-robin fashion Safe sequence: