1.A known relationship mode of R (U, F), U= (A, B, C, D, E, G); F={AB->C, D->EG, C->A, BE->C, BC->D, CG->BD, ACD->B, CE->AG}; find the minimum cover of F, then use the Normal Form decomposition...

1.A known relationship mode of R (U, F), U= (A, B, C, D, E, G); F={AB->C, D->EG,
C->A, BE->C, BC->D, CG->BD, ACD->B, CE->AG}; find the minimum cover of F,
then use the Normal Form decomposition algorithm to decompose this mode to 3NF, and
check if the decomposition has the nonadditive join property.