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 ?

• A. Topological order
• B. Depth - first order
• C. Breadth - first order
• D. Ascending order of transaction indices