Consider the following schedule for transactions T1, T2 and T3:
Which one of the schedules below is the correct serialization of the above?
Answer is option A.
create precedence graph and apply Topological sort on it to obtain
$T1 \rightarrow T3 \rightarrow T2$
The solution is described here.
hence option A is True.