This is from Operating Systems Class:

Given the following state for the Banker's Algorithm.

$6$ processes PO through P$5$

$4$ resource types: A $(15$ instances$)$; B $(6$ instances$)$; C $(9$ instances$)$; D $(10$ instances$)$

Snapshot at time TO:

Available

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 $($working array$)$ changes as each process terminates.

Choose from processes that could run to completion in this order: P$0,$ P$1,$ P$2,..$P$5$ in a round$-$robin fashion....

Safe sequence: $\backslash (<mtext></mtext><mi>\backslash </mi><mi>)</mi>$

Choose from processes that could run to completion in this order: P$0,$ P$1,$ P$2,...$P$5$ in a round$-$robin fashion....

Safe sequence: $$