Consider the following schedule S: (R1(X) means T1 read X, W2(Y) means T2 write Y)

R1(X), W2(Y), W2(X), W3(Y), W1(Y), Commit T1, Commit T2, Commit T3.

1. Determine whether S is: conflict-serializable.
2. For each of the following concurrency control mechanisms, describe how the concurrency control mechanism handles S.
   1. Strict 2PL with deadlock detection. (show the waits-for graph)
   2. Timestamping.

Note: for the deadlock detection, you need to draw waits-for graph to show whether there is a deadlock. (If there is a cycle in the graph, it means deadlock happened.)