Let $A$ be the set of all functions $f: Z \rightarrow Z$ and $R$ be a relation on $A$ such that $R = {(f, g): f(0) = g(1) \text{ and } f(1) = g(0)}$. Then $R$ is :

The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.

Let $A=\{2,3,6,7\}$ and $B=\{4,5,6,8\}$. Let $R$ be a relation defined on $A \times B$ by $(a_1, b_1) R(a_2, b_2)$ if and only if $a_1+a_2=b_1+b_2$. Then the number of elements in $R$ is __________.

Let R be a relation from the set ${1, 2, 3, …, 60}$ to itself such that $R = {(a, b) : b = pq}$, where $p, q \geqslant 3$ are prime numbers}. Then, the number of elements in R is :

Let $A = \{-3, -2, -1, 0, 1, 2, 3\}$ and R be a relation on A defined by $xRy$ if and only if $2x - y \in \{0, 1\}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in R to make it reflexive and symmetric relations, respectively. Then $l + m + n$ is equal to: