Consider two concurrent transactions T 1

and T 2

which write the same data object x and perform concurrency control using two-phase locking. Show that if T 1

wrote x before T 2

, then the lock-point of T 1

must precede the lock-point of T 2

. (The lock-point of a transaction is the stage at which it has acquired all needed locks.)