In a database system, unique timestamps are assigned to each transaction using…

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?