Jump to level $1$

Does the graph represent a deadlock state?

Give a list of processes in the order of removal from the graph until the graph is completely

reduced or until no more reductions are possible. If no process can be removed, enter "none".

Give a list of processes involved in the deadlock. If no deadlock exists, enter "none".