Given two finite sets $A$ and $B$ such that $n(A) = 2$ and $n(B) = 3$. Then the total number of relations from $A$ to $B$ is:

$A = \{1, 2, 3, 5\}$ and $B = \{4, 6, 9\}$. Define a relation $R$ from $A$ to $B$ by $R = \{(x, y) : \text{the difference between } x \text{ and } y \text{ is odd}; x \in A, y \in B\}$. Write $R$ in roster form.

If $R$ is a relation from set $A$ to set $B$,then

Let $A = \{1, 2, 3\}$ and $B = \{1, 3, 5\}$. If a relation $R$ from $A$ to $B$ is defined as $R = \{(1, 3), (2, 5), (3, 3)\}$,then find the inverse relation ${R^{ - 1}}$.

If $A$ is the set of even natural numbers less than $8$ and $B$ is the set of prime numbers less than $7$,then the number of relations from $A$ to $B$ is

Let $n(A) = n$. Then the total number of relations on $A$ is: