Schedules of $T_1$: $R_1(X),W_1(Y),R_1(X),W_1(X)$; $T_2$: $W_2(X),W_2(Y)$.
Conflicts exist on $X$ and $Y$ between $T_1$ and $T_2$. Draw the precedence graph ($T_a\to T_b$ if a conflicting operation of $T_a$ precedes one of $T_b$).
**(A)** $R_1(X)$ before $W_2(X)$ gives $T_1\to T_2$. $W_2(X)$ before the second $R_1(X)$ gives $T_2\to T_1$. Cycle. Not serializable.
**(B)** $W_2(X)<R_1(X)$, $W_2(Y)<W_1(Y)$, $W_2(X)<W_1(X)$: all give $T_2\to T_1$. No cycle. **Conflict serializable** (equivalent to $T_2$ then $T_1$).
**(C)** $R_1(X)<W_2(X)$ gives $T_1\to T_2$; $W_2(X)<R_1(X)$ (the second read) gives $T_2\to T_1$. Cycle.