1. (20 points) Consider a relation about people in the United States, including their name, Social Security number, street address, city, state, ZIP code, area code, and phone number (the last 7 digits). What FD’s would you expect to hold? What are the keys for the relation?2.    (20 points) Consider a relation with schema R(A, B, C, D) and FD’s AB ? C, C ? D, and D ? A.a)    Identify and proof whether the following FDs follow from the given FDS.AC ? D, CD ? A.b)   What are the keys of R?c)    What are the superkeys for R that are not keys?3.    (20 points) Suppose we have relation R(A, B, C, D, E), with some set of FD’s. Compute the attribute closure for each of the following cases:a)    AB ? DE, C ? E, D ? C, and E ? A. Compute .b)   A ? D, BD ? E, AC ? E, and DE ? B. Compute .4.    (20 points) For each of the following relation schemas and sets of FD’s:a)    R(A, B, C, D) with FD’s AB ? C, C ? D, and D ? A.b)   R(A, B, C, D, E) with FD’s AB ? C, C ? D, D ? B, and D ? E.Decompose the relations, as necessary, into collections of relations that are in BCNF. Do not forget to consider FD’s that are not in the given set, but follow from them.5.    (20 points) For each of the relation schemas and sets of FD’s of Question 4. Decompose the relations, as necessary, into collections of relations that are in 3NF.