Exercise $2$: Binary vs$.$ Ternary vs$.$ Aggregation $(25$ Points$)$

Assume a driving school with the following information.

$$ There are instructors. Each instructor is identified by an id$.$ Additionally, they have a name.

$$ There are students. Each student is identified by an id$.$ Additionally, they have a name and an

address.

$$ When a student signs up at the driving school, they are assigned a subset of the instructors $($one or

more$).$

$$ A driving lesson is at a certain date and time. It is of a certain type $($city drive, country$-$side drive,

highway drive, night drive, $...).$

$$ Each driving lesson is given by exactly one instructor and it is exactly one student who is taking

this driving lesson. Only an instructor who is assigned to a student can give a driving lesson to this

student.

$1.$ Draw three types of E$/$R diagram that attempt to reflect all the information: $($a$)$ using $3$ binary

relationship sets; $($b$)$ using a ternary relationship set; $($c$)$ using aggregation.

$2.$ Indicate for each of the diagrams whether it fully captures all constraints. If yes, explain why. If not,

explain what is missing$/$wrong