Please solve step by step according to the question first t1 and than t2 , next step t2 and than t1

thank you

First figure out what the serial executions T1 and then T2 and T2 and then T1 would produce in the database. This way you will know if the schedules given are serializable. Given the following schedule T1 T2 Read (C) Read (D) CEC+3 Write (C) ; d ; Read (C) CEC * 0.3 Write (C) DED+ 32 Write (D) Read (D) DED-2 Write (D) a. Is it conflict serializable? b. List each pair of conflicting operations. Say which transaction does its conflicting operation first