Using 2PL for the following schedule, assume that each transaction takes a lock on each database element immediately before it reads or writes the element, and that each transaction releases its locks immediately after the last time it accesses 2 an element. Tell what the locking scheduler would do with each of these schedules; i. e., what requests would get delayed, and when would they be allowed to resume. If there is a deadlock, you must specify it. r1(A); r2(B); w4(A); w1(C); r3(B); r3(C); w2(B); w3(A)