Consider the three transactions T I, T2, and T3, and the schedules 51 and 52 given below. Draw the serializability (precedence) graphs for 51 and 52' and state whether each schedule is serializable or...

Consider the three transactions T I, T2, and T3, and the schedules 51 and 52 given

below. Draw the serializability (precedence) graphs for 51 and 52' and state

whether each schedule is serializable or not. If a schedule is serializable, write

down the equivalent serial schedule(s).

T I: rl (X); r l (2); WI (X);

T2: r2 (2); r2 (Y); W2 (2); W2 (Y);

T3: r3 (X); r3 (Y); W3 (Y);

51: rl (X); r2 (2); rl (2); r3 (X); r3 (Y); WI (X); W3 (Y); r2 (Y); W2 (2); W2 (Y);

52: rl (X); r2 (2); r3 (X); rl (2); r2 (Y); r3 (Y); WI (X); W2 (2); W3 (Y); W2 (Y);