Consider the three transactions T$1,$ T$2,$ and T$3,$ and the schedules S$1$ and S$2$ given below. Draw the serializibility $($precedence$)$ graphs for S$1$ and S$2$ and state whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule$($s$).$ T$1$: r$1($x$)$; r$1($z$)$; w$1($x$)$ T$2$: r$2($z$)$; r$2($y$)$; w$2($z$)$; w$2($y$)$ T$3$: r$3($x$)$; r$3($y$)$; w$3($y$)$ S$1$: r$1($x$)$; r$2($z$)$; r$1($x$)$; r$3($x$)$; r$3($y$)$; w$1($x$)$; w$3($y$)$; r$2($y$)$; w$2($z$)$; w$2($y$)$ S$2$: r$1($x$)$; r$2($z$)$; r$3($x$)$; r$1($z$)$; r$2($y$)$; r$3($y$)$; w$1($x$)$; w$2($z$)$; w$3($y$)$; w$2($y$)$ Note: $$ ri $($X$)$; denote read of data object X by Transaction Ti$.$ Wi $($X$)$; denote write on data object X by Transaction Ti$.$