Consider the following schedules Constructing the precedence graphs for schedules E and F to test for conflict serializability (b) Transaction T Transaction T Transaction T2 read_item(z); read_item(Y); write_item(Y); read_item(Y): read_item(z); Time read_item(X); write_item(X); write_item(Y); write_item(Z); read_item(X); read_item(Y); write_item(Y); write_item(X); Schedule E Figure 21.8 Another example of serializability testing. (a) The read and write operations of three transactions T, T and T. (b) Schedule E. (C) Schedule F. Adden Wesley PEARSON