Suppose a database schedule 5 involves transactions T1, T2, .............Tn Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?
1
Topological order
2
Depth - first order
3
Breadth - first order
4
Ascending order of transaction indices