database systems

2.3) Given the following schedule, draw the wait-for graph. Is there a deadlock? T4 T1 Lock-S (A) R (A) T2 T3 Lock-X (B) W (B) Lock-S (B) Lock-s (C) R (C) Lock-X (C) Lock-x (B) Lock-x (A) 2.4) Consider the following two transactions T1 and T2: T1: R(X) W(X) R(Y) WM_Commit T2: R(Y) W(Y) R(X) W(X) Commit Show a schedule for T1 and T2 operations that leads to a deadlock when you use exclusive/shared locking (i.e., 3-state locking). Draw the wait-for graph for your chedule Question 3: 3.1) Explain how does the recovery manager ensure atomicity of transactions? 3.2) Explain how does the recovery manager ensure durability of transactions