R(ABCDEG)
AB->C
AC->B
BC->A
AD->E
B->D
E->G
R1(ABC) AB->C, AC->B, BC->A
R2(ABDE) AD->E B->D
R3(EG) E->G
We got all dependencies back, hence this decomposition is Dependency Preserving.
Join R2 and R3, E is common b/w R2 and R3, and E is CK for R3(lossless condition satisfied)
=R23(ABDEG)
now join R23 and R1, AB is common b/w both AB is CK of one relation( lossless condition satisfied)
R(ABCDEG)
This decomposition is both lossless and D.P hence option (A) is correct.