Equal Inversions

JJ has two binary strings $A$ and $B$, both of length $N$. He can perform the following operations on $A$: $\\$ **1.** Pick any index $i$ $(1 \le i \le N)$ and flip $A_i$ (i.e. change $0$ to $1$ and $1$ to $0$) $\\$ **2.** Reverse $A$ JJ wants the number of *inversions* in $A$ to be equal to the number of *inversions* in $B$ by performing **at most** $\lceil \frac{N}{2} \rceil$ operations. Can y