S to T

You are given $2$ binary strings $S$ and $T$, of length $N$. Here, binary strings means both $S$ and $T$ contain only $0$s and $1$s. Is it possible to make $S$ equal to $T$ using at most $3 \cdot N$ such operations: - Choose $1 \le i < N$ such that $S_i = 1$ and then flip $S_{i + 1}$, i.e. change it from $0$ to $1$ or $1$ to $0$. If it is possible, please print an operation sequence. If it is i