Let T1 have the operations r(x); w(x); r(y); w(y) and T2 have the operations r(x); w(x). Consider adding either a commit or abort to each of the transactions T1 and T2 and consider the different possible concurrent (not serial) schedules. From among these dierent possible concurrent schedules (with either a commit or abort added), give examples of:
(a) A schedule which is non-recoverable.
(b) A schedule which is recoverable but is not strict.
(c) A schedule which is strict, but not serial.
Note that you are free to add either a commit or an abort to T1 and either a commit or an abort to T2 for each of the above problems i.e. in one you may decide to add commits to both T1 and T2, in another an abort to T1 but a commit to T2 etc.