Consider the following two schedules; Schedule A and Schedule B$,$ as given below:

$[2$ Marks$]$

Schedule A:

T$1$: R$1($X$)$; W$2($Y$)$; W$1($Y$)$; R$3($Z$)$; R$1($Y$)$; W$2($X$)$; W$2($Z$)$; W$3($X$)$ T$2$: R$1($Y$)$; W$1($X$)$; R$2($Y$)$; R$2($X$)$

T$3$: W$1($Z$)$; W$3($Y$)$; R$3($X$)$; R$2($Z$)$; R$1($Z$)$

Schedule B:

T$1$: R$1($X$)$; R$2($Y$)$; W$1($X$)$; R$2($Z$)$; W$2($X$)$; W$3($Z$)$; R$3($X$)$

T$2$: R$1($Y$)$; R$3($Z$)$; W$1($Y$)$; R$2($X$)$; R$2($Z$)$

T$3$: R$1($Z$)$; W$2($Y$)$; R$3($X$)$; W$1($Z$)$

Draw the precedence graph for Schedule A and Schedule B$.$ State whether Schedules are conflict$-$serializable or not, and explain your reasoning.