Suppose that you are contacted by the UMD Housing and dining office to design for them

a new database for storing information about dorms and the dining center. For each student,

the database stores his$/$her UMD id$,$ name, permanent address $($street$,$ city, state$),$ birth date,

and gender. Assume that students can be housed in exactly one of the following buildings:

Burntside Hall, Griggs Hall, Iani Hall. For each student, the database keeps track of the

name of the building and the room number where the student lives; it also keeps track of

the move in and move out dates for each room that the student has ever lived in$.$ Students

may optionally have a meal plan for a given semester; the database keeps track of the num$-$

ber of meals left and the date and time of each visit to the dining center; assume that stu$-$

dents can only dine at the Superior Dining Center.

UMD wants to perform the following queries on the database:

A given student moves into a given room at UMD.

Find all the students who visited the dining center on a given day.

Now, perform the following activities:

Activity $1(50$ pts$.)$: Database Design

a$)(25$ pts$.)$ Draw the E$-$R diagram for this application. You can draw your diagram

using "Dia" or by hand and scanning it$.$

b$)(25$ pts$.)$ Reduce your E$-$R diagram to an appropriate set of relational schemas using

the algorithm seen in class. Write the primary keys and foreign keys of each table.

Write down any constraints that cannot be modeled with the relational model.