Please provide the reasoning

Question

A schedule $S: T_1 Read(x);$

$T_2: Write(x); T_2:Write(y); T_3: Write(y);T_1$

$Write(y); T_1: commit; T_2:commit; T_3:commit$

The above schedule is_________.

1. View serializable 

2. conflict serializable

100. recoverable

500. not serializable

Comments

Yes, (D) is the answer.

---

It is not conflict serializable as there is a cycle, if T2 failed to commit then we can't rollback changes as T1 has already committed. So it is not recoverable. How to determine if schedule is not serializable? Also as there is blind write in T2 schedule may or may not be view serializable, how to determine view serializibility?

---

yes see there is blind write there and the final write is in T1 so it finish last  which make a cycle