2. Consider the three transactions T1, T2, and T3, and the schedules S5 and S6 given below. Show all conflicts and draw the serializability (precedence) graphs for S5 and S6, and state whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule(s). Tl: rl(x); rl(z); w1(x); T2: r2(z); r2(y); w2(z); w2(y); T3: r3(x); r3(y); w3(y); SS: r1(X); r2(2): r1(2); r3(X); r3(Y); w1(x); cl: w3(Y); c3, r2(Y): w2(Z): w2(Y); c2; S6: r1(X): r2(2): r1(2); r3(X); r3(Y); w1(x); w3(Y); r2(Y): w2(Z); w2(Y); cl; c2; c3