Write down the conflicting operations present in the following schedule and draw the precedence graph.

r2 (Y); r3 (X); w2 (X); w1 (Y); r1 (Z); w2 (Y); w1 (Z); r3 (Z); w3 (X); w3 (Z);

Determine whether the schedule is serializable. If the schedule is serializable, write down an equivalent serial schedule. pls tell me which answer is correct and why

do not answer if u r not an expert and give me reason for which one being correct and others wrong

( ; () ;(st() (=21st = ) ; tey 213 ) () ) 3 () (6)} ( ()7) The waiting (7) ) since graph has Soricizable Cycle aus Aly) >(2) WM) w(2) H2) w2 (2) T2 T TI-T2 TLT 3 T35T2 TI-) Tz TRTS there axist + a cycle in a wreaph the schedule sercial rolele. AS T1 T3 T2 r(Y) r(x) w(X) w(Y) r(z) w(Y) w(z) r(z) w(X) w(Z) Conflicting actions in this schedule is r3(x) to w2(X) r2(Y) to w1(Y) w1(Y) to w2(Y) r1(Z) to w3(2) Precedence graph for this schedule will be T1 T2 T3 Since we have a cycle in precedence graph therefore this schedule is not conflict serializable