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

  • A

    $4$

  • B

    $8$

  • C

    $64$

  • D

    None of these

Similar Questions

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

Find the domain of $R$

Let $A=\{1,2,3,4,5,6\} .$ Define a relation $R$ from $A$ to $A$ by $R=\{(x, y): y=x+1\}$

Depict this relation using an arrow diagram.

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

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

$(a, b) \in R ,(b, c) \in R$ implies $(a, c) \in R$

The Fig shows a relationship between the sets $P$ and $Q .$ Write this relation

roster form

What is its domain and range?