Databases System: Exercise 18.2.4.

For each of the following schedules:

r₁(A); r2 (A); r3 (B); w₁>i(A); r2 (C); r2 (B); w2 (B); W₁(C);

r₁(A); W₁(B); r₂(B): w2 (C); r3 (C); w3 (A);

r₁(A); r2 (A); w₁(B); w2 (B); r₁ (B ); r₂(B); w2 (C); w₁(D).

Answer the following question:

i. What is the precedence graph for the schedule?

ii. Is the schedule conflict-serializable? If so, what are all the equivalent serial schedules?