Showthat the following proposed protocol for a timestamp-ordered concurrency control is not recoverable.

Store with each data item the maximum timestamp of any (not necessarily
committed) transaction that has read that item and the maximum timestamp
of any (not necessarily committed) transaction that has written that item.
When a transaction makes a request to read (write) a data item, if the
timestamp of the requesting transaction is smaller than the write (read) timestamp
in the item, restart the transaction; otherwise, grant the request.

What will be an ideal response?

If a transaction reads a value written by an uncommitted transaction and then commits.