draw erdiagrams 1

1. (26 points) The ERD below describes a database that records professional athlete salaries. Regarding the “plays for” relationship, assume that the same athlete can play for the same team for multiple seasons, but cannot sign multiple contracts with the same team during the same season. Degree tracks which degree a player earned from a specific college, including the degree type, major, and year (e.g., BA, Biology, 2016). Assume that a player cannot earn multiple degrees from the same school.

A. Transform the ERD into a graphical relational schema, following the directions in Ch. 4 and Lecture 7. Make sure to include primary keys, foreign keys, and relationships. Note: Do not create any new, surrogate keys.

B. Diagram the functional dependencies. You can do this on the same set of relations you created for part a, or copy the relations to a new sheet. If you include the relationship arrows and dependency arrows on the same sheet, use different colors.

2. (24 points) The data table below shows a relation called PETS, which records information about owners and animals signed up for a pet sitting business.

a. Construct a single graphical relation for PETS and diagram the functional dependencies. Make sure to include primary keys, foreign keys, and relationships, if needed. Note: Do not create any new, surrogate keys.
b. What is the normal form of this relation? Explain why and be specific. Provide your answer as a text box or on a new sheet.

c. Break down PETS into a set of third normal form relations. Draw the graphical relational schema and diagram the functional dependencies and relationships using different colored arrows. Note: Do not create any new, surrogate keys.