Solve the following questions: 1. Find out if the following schedules are conflict serializable or not? If a schedule is conflict serializable, get its corresponding serial schedule: [Hint: assuming all transactions are committed at the end of the schedule] 1. R1(x),R3(x),W1(x),R2(x),W3(x) 2. R1(x),R3(x),W3(x),W1(x),R2(x) 3. R3(x),R2(x),W3(x),R1(x),W1(x) 4. R3(x),R2(x),R1(x),W3(x),W1(x) 5. R1(x),R2(z),R1(z),R3(x),R3(y),W1(x),W3(y),R2(y),W2(z),W2(y) 6. R1(x),R2(z),R3(x),R1(z),R2(y),R3(y),W1(x),W2(z),W3(y),W2(y) 2. Check for the following properties: (conflict serializable, view serializable, Recoverable, Avoid-Cascade-Abort, and Strict) at the following schedules: 1. T1:R(x),T2:R(y),T1:W(x),T2:R(x),T1:R(y). [Hint: Assuming all transactions are either committed or aborted at the end of schedule] 2. T1:R(x), T2:W(x), T1:W(x), T2:Abort, T1:Commit 3. T1:W (x),T2:R(x),T1:W(x),T2: Abort, T1:Commit 4. T1:W(x),T2:R(x),T1:W(x),T2:Commit, T1:Abort 5. T1:R(x), T2:W(x), T2:Commit, T1:W(x), T1:Commit, T3:R(x), T3:Commit