Consider the following database schedule with $3$ transactions, $T1$ ,$T2$ and $T3$. Where $r$ stands for READ, w for WRITE.
$S : r2 (A); r1 (B); w2 (A); r2 (B); r3 (A); w1 (B); w3(A); w2 (B)$
Which one of the following statements about the above schedule is TRUE?
- the schedule is serializable
- the schedule is not serializable
- schedule will not execute
- this schedule have deadlock