Let T1 have the operations r(y), w(y) and T2 have the operations r(y), w(y), 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 different 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.