Option A.
$(A,B)$ $(B,C)$ $-$ common attribute is $B$ and due to $B\to C$, $B$ is a key for $(B,C)$ and hence $ABC$ can be losslessly decomposed into $(A,B)$ and $(B,C)$.
$(A, B, C) (B, D)$, common attribute is $B$ and $B\to D$ is a FD (via $B\to C, C\to D$), and hence, $B$ is a key for $(B, D).$ So, decomposition of $(A, B, C, D)$ into $(A, B, C) (B, D)$ is lossless.
Thus the given decomposition is lossless.
The given decomposition is also dependency preserving as the dependencies $A\to B$ is present in $(A, B), B\to C$ is present in $(B, C), D\to B$ is present in $(B, D)$ and $C\to D$ is indirectly present via $C\to B$ in $(B, C)$ and $B\to D$ in $(B, D).$
http://www.sztaki.hu/~fodroczi/dbs/dep-pres-own.pdf