A serialization Graph is used to test the Serializability of a schedule.

Assume a schedule S. For S, we construct a graph known as a precedence graph. This graph has a pair G = (V, E), where V consists of a set of vertices, and E consists of a set of edges. The set of vertices is used to contain all the transactions participating in the schedule. The set of edges is used to contain all edges Ti ->Tj for which one of the three conditions holds:

---------------------------------------------------------------

Explain in detail and show all steps neat n clean