Problem 3: Serializability and Conflict-serializability (30 points) Consider the following schedules S1, S2, and S3 followed by transactions T,, T2 and T, on database objects A and B. on , Draw the precedence graph of transactions to determine whether schedules S1, S2, and S3 are conflict-serializable. (5 points *3-15 points) For the same schedules S1, S2 and S3, determine if they are serializable (or view-serializable). If found to be serializable, then give a corresponding serial schedule. If not serializable, provide a suitable justification. (5 points *3 15 points) a. b. S1: R3(A), W3(A), R2(B), R3(B), W,(B), R2(A), W2(A) S2: R2(B), R1(A), W(B), R(B W2(A), W,(A), R2(A)