Consider 2 schedules involving 3 transactions:

S1: r1(A); r2(A); w2(A); r3(B); r2(B); w3(B); w2(B); w1(A) S2: r1(A); r2(A); r3(B); w1(A); r2(C); r2(B); w2(B); w1(C)

a) For each schedule, draw the precedence graph and decide if the schedule is conflict-serializable.

b) For each schedule, if the schedule is conflict-serializable, give an equivalent serial schedule. If the schedule is not conflictserializable, explain why not.