In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let and be the timestamps of transactions and respectively. Besides, holds a lock on the resource , and has requested a conflicting lock on the same resource . The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp.
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?
code
- AThe database system is both deadlock-free and starvation-free.
- BThe database system is deadlock-free, but not starvation-free.
- CThe database system is starvation-free, but not deadlock-free.
- DThe database system is neither deadlock-free nor starvation-free.

