1.. organizes a sequence of SQL statements in a transaction such that if one SQL statement in the same transaction fails, all SQL statements in the same transaction must not succeed in updating the...

Extracted text: 1.. organizes a sequence of SQL statements in a transaction such that if one SQL statement in the same transaction fails, all SQL statements in the same transaction must not succeed in updating the database. A SQL statement is implemented by a DBMS as a read action, a write action, or a sequence of read or write actions. Your answers to these questions are to be of no less details than those given in WK8_PracticeProblems_Solution.pdf. Consider the following actions taken by transaction T1 on database objects X and Y: R(X), R(Y), W(X), W(Y) A transaction is an execution of a user program seen by a DBMS. An application developer а. Give an example of another transaction T2 that, if run concurrently to transaction T1 without concurrency control, does not interfere with T1. Provide reasons to support your answer. b. (9 points) Give an example of another transaction T3 that, if run concurrently to transaction T1 without some form of concurrency control, could create a write-read conflict (or dirty read) with T1. Specify in your schedule where the conflict occurs. Show how the Strict Two Phase Locking protocol can prevent the interference. c. (9 points) Give an example of another transaction T4 that, if run concurrently to transaction T1 without some form of concurrency control, could create read-write conflict (or unrepeatable read) with T1. Specify in your schedule where the conflict occurs. Show how the Strict Two Phase Locking protocol can prevent the interference.