Let $A$ be the set of all $3 \times 3$ scalar matrices with real entries. If $f: A \rightarrow R$ is defined by $f(M) = \operatorname{det}(M)$ for all $M \in A$,then $f$ is

Match the following:

$(A)$ $f: R \rightarrow R$ is such that $f(x)=px+q$ $(p \neq 0)$,$\forall x \in R$	$I.$ $f$ is neither one-one nor onto
$(B)$ $f: R \rightarrow R^{+} \cup\{0\}$ is such that $f(x)=x^2$,$\forall x \in R$	$II.$ $f$ is both one-one and onto
$(C)$ $f: N \rightarrow N$ is such that $f(n)=n^2+2n+3$,$\forall n \in N$	$III.$ $f$ is one-one but not onto
$(D)$ $f: R \rightarrow R$ is such that $f(x)=2(\cos ^2 5x+\sin ^2 5x)$ $\forall x \in R$	$IV.$ $f$ is onto but not one-one
	$V.$ $f$ is a constant function and also a bijection

Let $f : R \to R$ be defined by $f(x) = \frac{ax^2 + ax + b}{ax + b}$. Then:

$f: N \rightarrow N$,is defined by $f(x)=x^6$ then, . . . . . . .

Let $A = \{x_1, x_2, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. The total number of onto functions $f : A \to B$ such that there exist exactly three elements $x$ in $A$ with $f(x) = y_2$ is equal to:

If the function $f: R \rightarrow R$ is defined by $f(x)=x|x|$,then: