Let n be a positive integer, X \equal{} \{1, 2, \ldots , n\}, and k a positive integer such that 2n≤k≤n. Determine, with proof, the number of all functions f:X↦X that satisfy the following conditions:
(i) f^2 \equal{} f;
(ii) the number of elements in the image of f is k;
(iii) for each y in the image of f, the number of all points x∈X such that f(x)\equal{}y is at most 2. functionalgebra unsolvedalgebra