Let R be a binary relationship between the entity sets E1 and E2. Consider the following instances for E1, E2, and R:

E1 = {a1, a2, a3, a4, a5, a6} E2 = {b1, b2, b3, b4, b5, b6, b7} R = {(a1, b1), (a2, b1), (a3, b2), (a4, b4), (a5, b6), (a6, b6)}

Draw the E/R diagram for E1, E2 and R indicating the strongest constraints (most restrictive) in terms of key and participation constraints you can define such that the above instances of E1, E2 and R are valid. Explain why/how any further constraint would be violated by the above instances.