Consider the following set of transactions accessing database objects $\backslash ($ A$,$ B $\backslash ),$ and $\backslash ($ C $\backslash ).$ The following figure shows an interleaved execution schedule for transactions $\backslash ($ T$\_\{1\},$ T$\_\{2\}\backslash ),$ and $\backslash ($ T$\_\{3\}\backslash ).$

$1.$ Give the dependency graph for the schedule in the figure. $(20$ points$)$

$2.$ Is the schedule conflict$-$serializable? $($Just Yes or No$)(5$ points$)$

$3.$ If 'yes', give an equivalent serial execution; if not, briefly explain. $(10$ points$)$