Consider the database transactions listed below.

T$1$

a $=$ read$($x$)$

b $=$ read$($y$)$

write$($y$,$a$+$b$)$

commit

T$2$

e $=$ read$($z$)$

write$($y$,$e$+1)$

write$($x$,$e$+2)$

commit

Assume that the initial values of the persistent data items x$,$ y and z are the following:

x $=1,$ y $=2$ and z $=2.$

Show a sample concurrent execution of the transactions T$1,$ and T$2$ that is view

serializable and it is NOT conflict serializable.

Prove that the execution is view serializable and it is NOT conflict serializable.

To prove that the execution is view serializable and it is NOT conflict serializable use a

technique of two$-$dimensional diagrams