Consider the following schedules involving two transactions.

Consider the following schedules involving two transactions. Which one of the following statements is true?
S₁ : r₁ (X); r₁ (Y); r₂ (X); r₂ (Y); w₂ (Y); w₁ (X)
S₂ : r₁ (X); r₂ (X); r₂ (Y); w₂ (Y); r₁ (Y); w₁ (X)

1. Both S₁ and S₂ are conflict serializable
2. S₁ is conflict serializable and S₂ is not conflict serialzable
3. S₁ is not conflict serializable and S₂ is conflict serializable
4. Both S₁ and S₂ are not conflict serializable

Lets construct the S₁ and S₂ with the time to check the serializable conflict.

S₁ → No serializable conflict
S₂ → Serializable conflict in w₁ (x)