$2$ schedules $\mathrm{S}_1$ and $\mathrm{S}_2$ are conflict equivalent iff Schedule $\mathrm{S}_1$ can be transformed into schedule $\mathrm{S}_1$ by a sequence of non-conflicting swaps of adjacent actions.
The given schedules are conflict equivalent because:
Both are conflict serializable because the precedence graph for $\mathrm{S}_1$ or $\text{S}_2$ will be :
$$\text{T}_1 \longrightarrow $\text{T}_2$
Hence, acyclic.
Another way to check conflict serializability is :
A schedule $\mathrm{S}_1$ is conflict serializable iff The schedule $\mathrm{S}_1$ can be transformed into a serial schedule by a sequence of non-conflicting swaps of adjacent actions.
So, schedules $\text{S}_1 , \text{S}_2$ are conflict-serializable schedules.
