$2.(40\text{'})$ Consider a database with objects $\backslash ($ X $\backslash )$ and $\backslash ($ Y $\backslash )$ and assume that there are two transactions T$1$ and T$2.$ Transaction $\backslash ($ T $1\backslash )$ reads objects $\backslash ($ X $\backslash )$ and $\backslash ($ Y $\backslash )$ and then writes object $\backslash ($ X $\backslash ).$ Transaction $\backslash ($ T $2\backslash )$ reads objects $\backslash ($ X $\backslash )$ and $\backslash ($ Y $\backslash ),$ then reads $\backslash ($ X $\backslash )$ once more, and finally writes objects $\backslash ($ X $\backslash )$ and $\backslash ($ Y $\backslash )($i$.$e$.$ T$1$: R$($X$),$ R$($Y$),$ W$($X$)$;T$2$: R$($X$),$ R$($Y$),\backslash ($ R$($X$),$ W$($X$),$ W$($Y$))\backslash )$

$1.$ Give an example schedule with actions of transactions T $1$ and T $2$ on objects X and Y that results in a write$-$read conflict.

$2.$ Give an example schedule with actions of transactions T $1$ and T $2$ on objects X and Y that results in a read$-$write conflict.

$3.$ Give an example schedule with actions of transactions T $1$ and T $2$ on objects X and Y that results in a write$-$write conflict.

$4.$ For each of the three schedules, show that Strict $2$PL disallows the schedule.