3. Consider the following transaction schedules. For each one, determine if the schedule is conflict serializable and determine the equivalent serial schedules. Please note that there may be several equivalent serializable schedules and you should determine all of them.

1. 1. T1: R(X); T3: R(X); T1: W(X); T2: R(X); T3: W(X); T1: R(X)
2. 2. T3: R(X); T2: R(X); T3: W(X); T1: R(X); T1: W(X); T1: R(X)