If $f : R \to R$ is defined by $f(x) = 2x + \cos x$,then $f$ is

Match the functions of List-$I$ with their nature in List-$II$ and choose the correct option.

$A$. $f: R \rightarrow R$ defined by $f(x) = \cos(112x - 37)$	$I$. Injection but not surjection
$B$. $f: A \rightarrow B$ defined by $f(x) = x|x|$ when $A = [-2, 2]$ and $B = [-4, 4]$	$II$. Surjection but not injection
$C$. $f: R \rightarrow R$ defined by $f(x) = (x-2)(x-3)(x-5)$	$III$. Bijection
$D$. $f: N \rightarrow N$ defined by $f(n) = n+1$	$IV$. Neither injection nor surjection
	$V$. Composite function

Show that an onto function $f: \{1, 2, 3\} \rightarrow \{1, 2, 3\}$ is always one-one.

Let $A$ be a set containing $10$ distinct elements. Then the total number of distinct functions from $A$ to $A$ is:

Let $f: R \rightarrow R$ be defined by $f(x) = 5^{-|x|} + \operatorname{sgn}(5^{-x})$, where $\operatorname{sgn}(x)$ denotes the signum function of $x$. Then $f$ is

The number of bijective functions $f : \{1, 3, 5, 7, \ldots, 99\} \rightarrow \{2, 4, 6, 8, \ldots, 100\}$ such that $f(3) \geq f(9) \geq f(15) \geq f(21) \geq \ldots \geq f(99)$ is: