Consider the following interleaving of transactions T and U: T U openTransaction openTransaction y= read(k); write(i, 55); write(j, 66); commit x= read(i); write(j, 44); The outcome of optimistic concurrency control with backward validation is that T will be aborted because its read operation conflicts with U's write operation on ai, although the interleaving are serially equivalent. Suggest a modification to the algorithm that deals with such cases.