help pls

Given the following transaction sequence: TIME TRANSACTION ACTION B 0 T1 READ A 1 T2 READ B T3 READ A 2. 3 T1 READ B 4 T3 READ C T1 UPDATEB T3 UPDATED 7 T2 ROLLBACK 8 T1 READ C 9 T3 READ B Hide Stop sharing psent at each of the indicated times (Time (a) llevigation monash edu is sharing your screen (a) Complete the table by clearly indicating what locks are present at each of the indicated times (Time Oto Time 9). (3 marks) Cell entries must have the form: S(Tn) - for a shared lock by Tn, X(Tn) - for an exclusive lock by Tn or Tn wait Tm - for a wait of Tn due to Tm (where n and m are transaction numbers). (b) Does a deadlock exist in this transaction sequence? Explain why you came to this conclusion. (2 marks) III H 2 C III B IUX ABC OF (a) A B D TIME TRANSACTION ACTION o READ A 1 T2 READ B 2 READ A T3 T1 READ B Report question issue Notes Question 10 Notes stop sharing evigation manashou is sharing your screen