Database course

3. Consider the following schedule S of two transactions rl(X), r2(Y), wl(Y), cl, w2(Z), c2 Tell whether (i) S is serial (ii) S is serializable i.e., it can be written as an equivalent serial schedule