Question #2. Consider the three transactions T1, T2, and 13, and the schedules $5 and S6 given below. Show all conflicts and draw the serializability (precedence) graphs for $5 and 56,

and state whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent serial schedule(s).