If `R` is a relation on a finite set having `n` elements, then the number of relations on `A` is `2^n` b. `2^n^2` c. `n^2` d. `n^n`

If R is a relation from a finite set A having m elements to a finite set B having n elements then the number of relations from A to B is 2^(mn) b.2^(mn)-1 c.. d.m^(n)

Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered pairs in R is

If R is a relation from a finite set A having m elements to a finite set B having n elements then the number of relations from A to B is

Let R be a reflexive relation on a finite set A having n elements and let there be m ordered pairs in R, then

r : If a finite set has n elements then its total number of substets is 2^n Converse of statement r is

If A and B are finite sets such that n(A)=m and n(B)=k ,find the number of relations from A to B .is equal to-

Statement-1 If a set A has n elements, then the number of binary relations on A = n^(n^(2)) . Statement-2 Number of possible relations from A to A = 2^(n^(2)) .