zero:

T$1$: 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$ ad T$2$ for concurrent execution leads to a serializable schedule or non serializable schedule $.$ Explain.