Draw serializability (precedence) graphs for the following schedules and state whether each schedule is (conflict) serializable. For each serializable schedule, determine the equivalent serial schedule. List all cycles for each schedule that is not serializable.
a. R1(X); R2(Y); W2(X); W1(Y); R1(Y); W1(X); W2(Y); R2(Y); R1(X);W1(X)
b. R2(Y); R1(X); W2(X); W1(X); W1(X); R3(Y); R1(Y); R2(Y); W3(X);W1(X)