In a system, there are $4$ resource types $($A$,$ B$,$ C$,$ and D$)$ and $3$ processes $($PO$,$ P$1,$ and P$2).$ The current allocation and maximum needs of resources for each process are as follows:

Allocation: Max Needs:

A B C D A B C D

PO $1112134322$

P$111001013121$

P$2121210,1350$

If the system currently has $3$ units of A$,3$ units of B$,3$ units of C$,$ and $2$ units of $D$ available, which of the following sequences of resource requests can be granted without leading to a deadlock using the Banker's algorithm?

$P1P0P2$

All sequences will lead to a deadlock.

$P2P1P0$

$POP2P1$