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 answer soon thank u