Count the number of functions

$\backslash$phi :$(10,9,...,7)->(10,9,...,7)$

so that

$($i$)\backslash$phi

is one$-$to$-$one and $\backslash$phi $(10)=8$

$($ii$)\backslash$phi $(1$ point$)$ Count the number of functions

$$:$(-10,-9,$dots,$-7)(-10,-9,$dots,$-7)$

so that

$($i$)$ is one$-$to$-$one and $(-10)=-8$

$($ii$)$ is one$-$to$-$one and $(-10)-8$

is one$-$to$-$one and $\backslash$phi $(10)!=8$