need help in database assignment

Problem 1, (20 points) Determine whether or not each of the following schedules is conflict- serializable and explain why. If conflict-serializable, show the steps of finding an equivalent serial schodule. In the schedules, r(X) and w,(Y) represent read(X) issued by transaction Ti and writelY) issued by transaction T', respectively (a) (10 points) r3(A);u4(A);Wy(A); tel (A); uplB) (b) (10 points) rs(C);i(A);r(B)wi(Bir(B); u(B) ra(A): (C) Problem 2, (20 points) Determine whether or not each of the following schedules is recoverable andfor cascadeless. Justify your answer. In the schedules, r/(X) and w,(Y) represent read( X) is- sued by transaction T, and writetY) issued by transaction T, rspectively, co, indicates committing transaction T (a) (10 points) (A):W2(A)-02;m(A);'ndA)in(A);on; (10 points) rl (A): (A); u2(B)m(B):m;Wy(B):eos