Database Management - Normalization

Given a relation R(A,B,C,D,X,Y,Z) with the following set of functional dependencies, circle the option that answers each of the following questions. {X Y, YZ, A B, A + CD) A. Use Armstrong's inference axioms (reflexibility, augmentation, transitivity, union, decomposition) to determine which functional dependencies CANNOT be derived. (3 points) a. AY AZ b. XZ c. A D d. XA B. Is this relation with columns (A, B, C, D, X, Y, Z) in 3NF form? In BCNF form? (3 points) a. Both 3NF and BCNF b. In 3NF but not BCNF c. In BCNF but not 3NF d. Neither in 3NF or BCNF C. If we were to break this relation into two relations, (X, Y, Z) and (A, B, C, D), which of these two relations would be in BCNF form? (3 points) a. Both (X, Y, Z) and (A, B, C, D) b. Only (X,Y,Z) c. Only (A, B, C, D) d. Neither D. Which of the following decompositions of the original relation are lossless join decompositions? (3 points) a. (A,B,C,D,X) and (X,Y,Z) b. (A,B,C,D,Y) and (Y,X,Z) c. (A,B,C,D) and (D,X,Y,Z) d. Choices A and B e. Choices A and C