4. For the following schedules draw the precedence graph and conclude whether the schedule is conflict serializable or not. Write the equivalent serial schedule if it is conflict serializable. If the schedule is not conflict serializable, identify the conflicting operations that prevents it from being conflict serializable

(a) W1(A); W2(B); W1(B); W2(A) (b) W2(C); R1(A); W3(B); R1(C); R3(B); R3(A); W1(B) (c) R1(A); W2(B); R2(A); W1(B); W3(B); W1(C); R3(B); W1(A) (d) R3(B); R2(A); R1(A); R2(C); W3(A); W2(B); W1(C) (e) R1(A); R1(B); R1(C); W3(A); R2(A); W1(C); W2(C); W3(B); R2(C); W3(B)