Q42

In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ respectively. Besides, $T_{1}$ holds a lock on the resource $R,$ and $T_{2}$ has requested a conflicting lock on the same resource $R.$ The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. if $TS(T_{2})<TS(T_{1})$ then $T_{1}$ is killed else $T_{2}$ waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?