1. Consider a table T which stores information about dogs using the following attributes: dog_number, dog_name, kennel_code, kennel_name, kennel_location, trick_id, trick_name, trick_where_learned, skill_level, costume. (Assume that the attribute trick_where_learned refers to some kennel_code).
For example, typical data might be
(52, Beau, 16, DaisyPuppyFarm, Hamden, 2343, rollover, 16, 2, none)
(89, Missy, 9, DansDogHouse, Hartford, 2345, shake-hands, 16, 4, red-coat).
(a) List a “natural” set of functional dependencies F. (Hopefully, it will be the minimal set).
(b) Decompose T into a set of tables satisfying 3NF. Determine the keys of each table in the decomposition.