2) Exercise 2 - Transactions and Concurrency Given the following two transactions T, and T2. Ty : R(q); R; (b); R(C); a = a x b-c;W (a); T2 : R2(b); c = 2 x b; W2(c); b = 21 +b; W2(b); (a) Provide a strict, serializable schedule S1, for T1, T2 (b) Provide a strict but non-serializable schedule S2, for T1, T2. (c) Given S3 : R2(b); R1(a); W2(c); R1(b); R1(c);W1(a); W2(6), is it conflict equivalent to any S, or S,? Justify. (d) Using share/exclusive locks, provide an interleaved schedule S for T1, T, following Strict 2PL, while maximizing the concurrency (e) Explain briefly the strategies that a DBMS may use to detect problems when using rigorous 2PL, and how can it be solved. Write full sentences