Consider the following sequences of actions, listed in the order they are submitted to the DBMS

Sequence S: T1:R(X), T2:W(X), T2:W(Y), T3:W(Y), T1:W(Y), T1:Commit, T2:Commit, T3:Commit

Assume that the timestamp of transaction Ti is i. For lock-based concurrency control mechanisms, add lock and unlock requests to the previous sequence of actions as per the locking protocol. The DBMS processes actions in the order shown. If a transaction is blocked, assume that all its actions are queued until it is resumed; the DBMS continues with the next action (according to the listed sequence) of an unblocked transaction.

1. describe how the strict 2PL with timestamps used for deadlock prevention handles the sequence based on wait-die policy. assume T1 has the highest priority, T2 has the second highest priority, and T3 has the lowest priority.

2Describe how the strict 2PL with deadlock detection mechanism handles the sequence.Show the waits-for graph if a deadlock cycle develops