Write a program to create all possible schedules for the three transactions in Figure 20.8(a), and to determine which of those schedules are conflict serializable and which are not. For each conflict-serializable schedule, your program should print the schedule and list all equivalent serial schedules.

Figure 20.8(a)

Figure 20.8 Another example of serializability testing. (a) The read and write operations of three transactions T1, T2, and T3. (b) Schedule E. (c) Schedule F. (a) Transaction T, Transaction T, Transaction T3 read_item(X); read_item(Z); read_item(Y); write_item(X); read_item(Y); read_item(Z); read item(Y); write_item(Y); write_item(Y); write_item(Y); read_item(X); write_item(Z); write_item(X);