Using Banker's Algorithm for deadlock avoidance in the following example:

$5$ processes $P_0$ through $P_4$;

$3$ resource types:

$A(10$ instances$),B(5$instances$),$ and $C(7$ instances$)$

Snapshot at time $T_0$ :

$1\mathrm{.}1)$ Exam at time $T_0$ whether the system is in a safe state or not.

$1\mathrm{.}2)$ Can request for $(1,0,2)$ by $P_1$ be granted?