$\begin{array}{c|c} \hline
\bf{T_1} & \bf{T_2} \\ \hline
r_1(x)\\
r_1(y) \\
&r_2(x)\\
&r_2(y) \\
&w_2(y) \\
w_1(x) \\ \hline
\end{array}$
Here $r_1(y)$ and $w_2(y)$ are conflicting pairs, giving $T_1\rightarrow T_2$ and $r_2(x)$ and $w_1(x)$ giving $T_2\rightarrow T_1$, so the schedule is not conflict serializable.
$\begin{array}{c|c} \hline
\bf{T_1} & \bf{T_2} \\ \hline
r_1(x)\\
&r_2(x)\\
&r_2(y) \\
&w_2(y)\\
r_1(y)\\
w_1(x) \\ \hline
\end{array}$
Here $r_2(x)$ and $w_1(x)$ are conflicting pairs giving $T_2\rightarrow T_1$, and $w_2(y)$ and $r_1(y)$ also giving $T_2\rightarrow T_1$, therefore this schedule is conflict serializable.
Correct Option B