JEE Main 202126 Feb, Evening shiftMathematicsHardSets, Relations and Functions168× since 2002Let 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)={k+1if k is oddkif k is evenf(k) = \left\{ {\matrix{ {k + 1} & {if\,k\,is\,odd} \cr k & {if\,k\,is\,even} \cr } } \right.f(k)={k+1kifkisoddifkiseven Then the number of possible functions g:A→Ag:A \to Ag:A→A such that gof=fgof = fgof=f is :AOption A. 5⁵BOption B. 10⁵COption C. 5!DOption D. ¹⁰C₅CheckSkip · show solution