Question $1(4$ Points$)$:

For each of the following schedules, draw the serlializability graph $($also known as

precedence graph or conflict graph$)$ and determine whether the schedule is conflict

serializable or no:

$1\mathrm{.}1)$

$1\mathrm{.}2)$