The set $A$ has $4$ elements and the set $B$ has $5$ elements. Then,the number of injective mappings that can be defined from $A$ to $B$ is:

$f:[-2,2] \rightarrow[-2,2]$ and $g:[-2,2] \rightarrow[0,4]$ are two functions defined as $f(x)=\begin{cases} -2, & -2 \leq x \leq 0 \\ x^2-2, & 0 \leq x \leq 2 \end{cases}$ and $g(x)=|f(x)|+f(|x|)$, then

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

$A$ function $f: R - \{ 0 \} \rightarrow R$ is defined as $f(x) = \begin{cases} x^2 + 3x - 7, & x > 0 \\ h(x), & x < 0 \end{cases}$ If $f(x)$ is an odd function, then $h(x) =$

Statement-$I$: Let $f : R \rightarrow R$ be a function such that $f(x) = x^3 + x^2 + 3x + \sin x$. Then $f$ is a one-one function.
Statement-$II$: $f(x)$ is a decreasing function.

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