Consider a database with objects x and y and assume that there are two transactions t1 and t2. transaction t1 reads objects x and y and then writes object x. transaction t2 reads objects x and y and then writes objects x and y.

1. give an example schedule with actions of transactions t1 and t2 on objects x and y that results in a write-read conflict

2. give an example schedule with actions of transactions t1 and t2 on objects x and y that results in a read-write conflict

3. give an example schedule with actions of transactions t1 and t2 on objects x and y that results in a write-write conflict.

4. for each of the three schedules, show that strict 2pl disallows the schedule