Bankers Algorithm

There are $3$ resources available: $1$ A$,0$ B$,0$ C$.$ Four processes are requesting the three resources as follows:

A B C

P$1002$

P$2150$

P$3235$

P$4052$

The currently allocated resources are

A B C

P$1001$

P$2100$

P$3135$

P$4032$

Provide an example ordering, starting with the lowest possible process number as P$1,$ P$2,$ P$3,$ P$4$ or determine a deadlock.