Consider the following transactions with data items P and Qiitalia to zero

TL: read$($P

read Q

If P$=0$ then Q$-$Q$-1$

write$($Q

T$2$: read$($Q$).$

read$($P$)$;

If Q$-0$ then P:$-$P$-1$;

write$($P

Solve and find any non$-$serial interleaving of T$1$ and $12$ for concurrent execution leads to a serializable schedule or non$-$serializable schedule Explain