Let $A = \{1, 2\}$ and $B = \{3, 4\}$. Find the number of relations from $A$ to $B$.

Let $A = \{11, 12, 13\}$ and $B = \{8, 10, 12\}$. $A$ relation $R$ from $A$ to $B$ is defined by $y = x - 3$. Then,find $R^{-1}$.

Let $R$ be a relation from $N$ to $N$ defined by $R = \{(a, b) : a, b \in N \text{ and } a = b^2\}$. Is the following statement true?
$(a, b) \in R$ implies $(b, a) \in R$

Let $A = \{1, 2, 3, 4, 6\}$. Let $R$ be the relation on $A$ defined by $R = \{(a, b) : a, b \in A, b \text{ is exactly divisible by } a\}$. Write $R$ in roster form.

If $A = \{1, 2, 3\}$ and $B = \{1, 4, 6, 9\}$,and $R$ is a relation from $A$ to $B$ defined by "$x$ is greater than $y$",then the range of $R$ is:

$A$ relation on the set $A = \{x : |x| < 3, x \in Z\}$,where $Z$ is the set of integers,is defined by $R = \{(x, y) : y = |x|, x \neq -1\}$. Then the number of elements in the power set of $R$ is