virtual test series

Question

Find the number of all possible conflict-equivalent schedules to the following serial schedule:

r₁(X);w₁(Y);w₁(Z);r₂(X);w₂(Y);w₂(Z);
where r_i(A) means i^th transaction reads resource A and w_i(A) means i^th transaction writes resource A.

Answer 1

I am getting T1->T2 only.