the consider that modes 1 following locking protocol allows only exclusive lock and that operates odata graphs that the form of rooted directed acyclic graph. A transaction lock vertex first To lock vertex, the of ransaction the parents musthave visited and must be of t hat one of lock vertex the the of ensures Show that the freedom, and serializability any other holding parents protocol deadlock