Let $W$ denote the words in the English dictionary. Define the relation $R$ by $R = {(x, y) ∈ W × W |$ the words $x$ and $y$ have at least one letter in common}. Then, $R$ is

Let $A = \{ (\alpha, \beta) \in R \times R : |\alpha - 1| \leq 4 \text{ and } |\beta - 5| \leq 6 \}$ and $B = \{ (\alpha, \beta) \in R \times R : 16(\alpha - 2)^2 + 9(\beta - 6)^2 \leq 144 \}$. Then

Let $A = \{-2, -1, 0, 1, 2, 3\}$. Let R be a relation on $A$ defined by $xRy$ if and only if $y = \max\{x, 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

Let $A=\{0,3,4,6,7,8,9,10\}$ and $R$ be the relation defined on $A$ such that $R=\{(x, y) \in A \times A: x-y$ is odd positive integer or $x-y=2\}$. The minimum number of elements that must be added to the relation $R$, so that it is a symmetric relation, is equal to ____________.

Let S = {1, 2, 3, 5, 7, 10, 11}. The number of non-empty subsets of S that have the sum of all elements a multiple of 3, is _____________.