Draw the Schedule in a horizontal timeline manner with the I and S locks before the W and R. Consider the following sequence of actions, listed in the order they are submitted to the DBMS. Assume Strict 2PL with deadlock detection. Draw a Wait For Graph (WFG) for the transactions and determine whether deadlock exists wl(x) r2(x) w2 (y) w2(x) ws (2) fS (v) wS (y) w () abortl What happens to T2 and T3 when T1 aborts? Create a waits-for graph: Nodes are transactions There is an edge from Ti to Tj if Ti is waiting for Tj to release a lock