$2\mathrm{.}1)(2$ Points$)$ Consider the following two transactions T$1$ and T$2$:

T$1$: R$($X$)$ W$($X$)$ R$($Y$)$ W$($Y$)$ Commit

T$2$: R$($Y$)$ W$($Y$)$ R$($X$)$ W$($X$)$ Commit

Draw a schedule for T$1$ and T$2$ operations that leads to a deadlock when you

use exclusive$/$shared locking $($i$.$e$.3-$state locking$).$ Draw the wait$-$for graph

for your schedule. Answer if deadlock exists or not.

Question $3(2$ Points$)$:

$3\mathrm{.}1)$ Explain how does the recovery manager ensure atomicity of transactions?

$3\mathrm{.}2)$ Explain how does the recovery manager ensure durability of transactions?