database question

3.2 Give an example of an interleaved conflict non-serializable schedule that is not equivalent to the serial schedule T1-) T2 and use the serializability test algorithm to prove that it is indeed not serializable. Follow these rules when producing the nonserializable schedule: (4 points) I. You cannot change the order of the conflicting operations in either transaction II. T1 You cannot add new operations to either transaction T2 read item(A); read item(B) read item(A); A: A+N; read item(C); B: B+ A; A: A+ B; write item(A); write item(B): read item(A); read item(B) read item(A): A A+N; read item(C) B:= B + A; A: A +B; write item(A); write item(B); A:-A+C; C:-C+M; write item(A); write item(C): T1 T2