Question 1 Part I: Consider the following schedule S1 that have three transactions T1, T2 and T3. The transactions perform read, write, and commits operations with the following symbols r, w and c statements respectively. SI: r2(b), w2(b), 13(c), w3(C), r3(a), w3(a), c3, r2(c), w2(c), c2, r1(a), r1(b), wl(a), wl(b), cl. Answer the following questions: I- Draw precedence graph for the above schedule. [1 Mark] [0.5 Mark] II- Is this schedule is serial schedule? Yes No III- Is this schedule conflict-serializable? [0.5 Mark] Yes INo Why? If yes, indicate the serialization (topological) order. IV- Is this schedule view-serializable? [0.5 Mark] OYes ON Why? Part II: For the following schedule, determine if it is recoverable, cascade-less schedules or not. Justify your answer. S: r1(x); r2(z); r3(x); r1(2); r2(y); r3(y); w1(x); w2(z); w3(y); w2(y).cl; c3; c2; I. [1.5 Mark] Is this schedule recoverable? Yes INo Justify your answer. II. Is this schedule cascadeless? [1 Mark] OYes No Justify your