An E/R diagram that includes a 3-way relationship R connected to the entity sets E1, E2, and E3 is converted into a relational database. Let m, n, and k be the number of tuples in some valid instances of E1, E2, and E3, respectively. In each of the following cases, determine the minimum, maximum, or exact (when applicable) number of tuples in R. We refer to this number as the size of R, denoted as |R|. For the size of R determined, what condition(s) must hold on the values m, n, and k.

(a) The connection from R to to E1 is a sharp arrow (that is, at most 1)

(b) The connections from R to E1 and to E2 are both sharp arrows.

(c) The connection from R to each one of these entity sets is a sharp arrow.

(d) The connection from R to E1 is a sharp arrow and from R to E2 is a round arrow (that is, exactly 1).