help with 4 please

CS210 Data Structures & Algorithm CI13 Test 3 part II Name: Match normalization with type. (3 pt.) Iff for every nontrivial X is a Superkey A. 3NF 4NF BCNF 1. B. Iff for every nontrivia 1. 2. X is a Superk A is prime 2. Iff for every nontrivi X is a Superkey C. 4. Decompose into 3NF R (A, B, C, D) KEY AB A, B -> C; A, B D; Answer(s) (4 pt.) 5. Decompose into 3NF R (A, B, C, D) KEY AB