MathematicsHard110×since 2002Q3803Let A={1,2,3,....,10}A = \{ 1,2,3,....,10\}A={1,2,3,....,10} and f:A→Af:A \to Af:A→A be defined as f(k) = \left\{ {\matrix{ {k + 1} & {if\,k\,is\,odd} \cr k & {if\,k\,is\,even} \cr } } \right. Then the number of possible functions g:A→Ag:A \to Ag:A→A such that gof=fgof = fgof=f is :A5⁵B10⁵C5!D¹⁰C₅Check answerSkip