For any binary strings check the last $k$ bits in the given strings:
If the last $k$ bits are completely $0$ then the number is evenly divisible by $2^k$ else it is not divisible
Here $4$ can be represented by $2^2$, in option $(A)$ last 2 bits are completely zero. so it is divisible by $4$.
Option $(A)$ is correct.