Consider the four following transactions $($using the basic version of timestamp based schedules $-$ i$.$e$.$ not MVCC$)$:

T$1$: write$($X$)$; write$($X$)$

T$2$: write$($X$)$; write$($Y$)$

T$3$: write$($Y$)$; write$($X$)$

T$4$: write$($Y$)$; write$($Y$)$

Let S$($Ti$,$Tj$)$ be some schedule over Ti and Tj$.$ Hence, e$.$g$.$ S$($T$1,$T$2)$ would be some schedule over T$1$ and T$2.$

Which of the following schedules could lead to starvation?