Subject: Database Management System

Consider the following Schedule. T1 T2 T3 T5 | T4 read(X) read(X) X = X+50 write(X) read(Z) Z = Z + 10 write(Z) read(Y) Y = Y + 30 write(Y). read(Y) read(Z) read(X) read(Y) Y = Y +(X*2) write(Y) Z = X+Y Y = Y - 100 write(Z) write(Y) Now, answer the following questions. 1. Draw the corresponding Precedence graph of the schedule. 2. Find if the Schedule is Serializable or not. If it is, then draw the Serial Schedule order for the Transactions