Part3- Instructions: Serializable Schedules [ 9 Marks] Consider the following schedules, where R, W, C stands for 'Read', 'Write' and 'Commit' respectively and subscripts refers to transactions (i.e., R1(X) means transaction T1 read X ): Schedule 1: R1(X), W1(X), R3(X), W3(X), W2(X), R1(Y), W1(Y), C1, W3(Y), C3, R2(Y), W2(Y), C2 Schedule 2: R2(X), W2(X), R3(Y), W3(Y), R3(Z), W3(Z), C3, R2(Z), W2(Z), C2, R1(X), W1(X), C1 Schedule 3: W1(A), W2(B), W3(C), R1(X), R2(X), R1(Y), W1(X), C1, W2(Y), C2, W3(Y), C3 For each schedule answer the following question: (a) Is this schedule Serializable? (b) If not and there is a conflict (for any reason), provide an equivalent Serial Schedule of transactions (c) Draw the dependency graph for each Schedule after step b