Question: 1. A relation NADDR is defined with attributes NAME (unique), STREET, CITY, STATE, and ZIP. For any given zipcode, there is just one city and state. Also. for any given sweet, city. and state. there is just one zipcode. Give an irreducible set of FDs for this relation. What are the candidate keys?
2. Relation R has attributes A. B. C. D, E. E G, N, I. J. and satisfies the FDs
ABD → E
AB → G
B → F
C → J
CJ → I
G → H
Is this an irreducible set? What are the candidate keys?