Task $2(3$ marks$)$

Serialization Graph Testing, $2-$Phase Locking and Timestamp Ordering schedulers

$(1)(2$ mark$)$

Consider the following concurrent execution of database transactions $T1,T2$ and T $3.$

$\backslash$table$[[$T$1,$T$2,$T$3],[,d=$read$(x),b=$read$(y)$

write $(y,b+2)$