(b) Given the following transaction sequence, copy and paste this sequence into your answer document and clearly indicate what locks are present at each of the indicated times (Time 0 to Time 34). 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). TIME TRANS ACTION A B C D E F G H 0 T1 Read A 1 T2 Read B 2 T1 Read C 3 T4 Read D 4 T5 Read A 5 T2 Read E 60 T2 Update E 7 T3 Read F 8 T2 Read F 9 T5 Update A 10 T1 Commit 11 T6 Read A 12 T5 Rollback 13 T6 Read C 14 14 T6 Update C 15 T7 Read G 16 T8 Read H 17 T9 Read G 18 T9 Update G 19 T8 Read E 20 T7 Commit 21 T9 Read H 22 T3 Read G 23 T10 Read A 24 T9 Update H 25 T6 Commit 26 T11 Read C 27 T12 Read D 28 T12 Read C 29 T2 Update F 30 T11 Update C 31 T12 Read A 32 T10 Update A 33 T12 Update D 34 T4 Read G Complete the following: (i) For each of the listed items A.. H, what wait states are present at time 34 (the last time listed). Shown the waits in the form: (ii) (!!!) Item A: T1 waiting on T5 Item B: ... etc (note this is an example ONLY) Prepare a wait for graph indicating the state of waiting locks at time 34. Your wait for graph can be prepared using any drawing package such as LucidChart or free hand drawn. Paste/insert an image of your wait for graph into your answer document below your answer to (i) above Report if deadlock exists or not, and if it does exist, list the transactions involved.