Notown Records has decided to store information about musicians who perform on its albums (as well as other company data) in a database. The company has wisely chosen to hire you as a database designer (at your usual consulting fee of $2500jday).

a. Each musician that records at Notown has an SSN, a name, an address, and a phone number. Poorly paid musicians often share the same address, and no address has more than one phone.
b. Each instrument used in songs recorded at Notown has a name (e. g., guitar, synthesizer, flute) and a musical key (e. g., C, B-flat, E-flat). c. c. Each album recorded on the Notown label has a title, a copyright date, a format (e. g., CD or MC), and an album identifier.
d. Each song recorded at Notown has a title and an author.
e. Each musician may play several instruments, and a given instrument may be played by several musicians.
f. Each album has a number of songs on it, but no song may appear on more than one album.
g. Each song is performed by one or more musicians, and a musician may perform a number of songs.
h. Each album has exactly one musician who acts as its producer. A musician may produce several albums, of course. Design' a conceptual schema for Notown and draw an ER diagram for your schema. The preceding information describes the situation that the Notown database must model. Be sure to indicate all key and cardinality constraints and any assumptions you make. Identify any constraints you are unable to capture in the ER diagram and briefly explain why you could not express them.