3. Given a concurrent schedule of two transactions:

Assume that the TS(T1) = 5 and TS(T2) = 10. We also assume all timestamps on data items A and B are initially 0. Show that the schedule above is not allowed in the timestamp protocol by tracing the execution steps of the schedule. List the timestamp of the transaction and both read and write timestamps of the data item for each step.

Steps	T1	T2
1	lock-S(A)
2	read(A)
3		lock-X(B)
4		write(B)
5		unlock(B) commit
6	lock-S(B)
7	read(B)
8	unlock(A)
9	unlock(B) commit