I am working through an example problem in which we are trying to identify which of the following relations is in Third Normal Form (3NF). Here are the relations we are given:

**R1(ABCD)  

ACD -> B   AC -> D   D -> C   AC -> B**

R2(ABCD)  

AB -> C   ABD -> C   ABC -> D   AC -> D

R3(ABCD)  

C -> B   A -> B   CD -> A   BCD -> A

R4(ABCD)  

C -> B   B -> A   AC -> D   AC -> B

I know the answer is R1 is in 3NF, but I'm having a hard time understanding the steps to go about determining what violates 3NF. Can someone break it down in plain English for each of the relations? It would be extremely helpful if you can show me in steps how each relation might violate one of the 3NF rules:

1. X -> A, then A is a subset of X
2. X is a superkey
3. A is a part of some key for R

For R1, the first step I take is breaking it down into closures:

ACD+ = ABCD  

AC+ = ABCD  

D+ = C

ACD and AC are superkeys, which satisfy rule 2.  

1. D -> C, but C is not a subset of D. Rule 1 violated.  

2. D is not a superkey. Rule 2 is violated.  

3. C is a part of some key for R. C is a part of AC and ACD. So, rule 3 is upheld? 

Not sure if I'm even doing these steps right, so please break it down as simple as possible for someone struggling with these concepts. Thanks.