Let $$f$$ be a function from a set $$A$$ to a set $$B$$, $$g$$ a function from $$B$$ to $$C$$, and $$h$$ a function from $$A$$ to $$C$$, such that $$h\left( a \right) = g\left( {f\left( a \right)} \right)$$ for all $$a \in A$$. Which of the following statements is always true for all such functions $$f$$ and $$g$$?

Let $${R_1}$$ be a relation from $$A = \left\{ {1,3,5,7} \right\}$$ to $$B = \left\{ {2,4,6,8} \right\}$$ and $${R_2}$$ be another relation from $$B$$ to $$C$$ $$ = \left\{ {1,2,3,4} \right\}$$ as defined below:

i) An element $$x$$ in $$A$$ is related to an element $$y$$ in $$B$$ (under $${R_1}$$) if $$ x + y $$ is divisible by $$3$$.
ii) An element EExEE in $$B$$ is related to an elements $$y$$ in $$C$$ (under $${R_2}$$) if $$x + y$$ is even but not divisible by $$3$$.

Which is the composite relation $$R1R2$$ from $$A$$ to $$C$$?

Consider the binary relation: $$S = \left\{ {\left( {x,y} \right)|y = x + 1\,\,and\,\,x,y \in \left\{ {0,1,2,...} \right\}} \right\}$$

The reflexive transitive closure of $$S$$ is

The number of different $$n$$ $$x$$ $$n$$ symmetric matrices with each elements being either $$0$$ or $$1$$ is (Note: power ($$2,$$ $$x$$) is same as $${2^x}$$)