Suppose that each process requests two units.
The requests are made in some order. The fourth
request cannot be met. But the process that was
allocated both units that it requested can run
to completion. After that, it must release its
resources, allowing the other process can run
to completion. So deadlock is not possible.
The initial state, where both processes state
that their maximum resource needs are two units,
is a safe state.