1) CONFLICT SERIALIZABLE.
$R_{i}(A)-W_{j} (A)$
$W_{i}(A)-W_{j} (A)$
$W_{i}(A)-R_{j} (A)$ //then there is edge between Ti and Tj.
if precedence graph contains loop ,it is not conflict serializable.
predendece graph edge exist between $W_{1}(A)-R_{2} (A)$ and $R_{2}(B)-W_{1} (B)$ .so loop formed no conflict seralizable.
2)VIEW SERIALIZABLE. (skips W-W problem)
$R_{i}(A)-W_{j} (A)$
$W_{i}(A)-R_{j} (A)$ //then there is edge between Ti and Tj.
if no loop it is view serializable.schdeule is not view serializable. $W_{1}(A)-R_{2} (A)$ and $R_{2}(B)-W_{1} (B)$ loop formed.
3)SERIALIZABLE.i)initial reads should be same.
ii)updated reads should be same.
iii)final writes should be same.
in transaction T2 reads a data item "A' which is updated by T1.so intial reads are not same.
not serializable.