Let \(S\) be a finite set. Then a non-identity function \(f: S \rightarrow S\) can be
Let \(S\) be a finite set. Then a non-identity function \(f: S \rightarrow S\) can be
Injective but not surjective
Surjective but not injective
Bijective but it does not have an inverse function
Data insufficient
Solution
It is given that for a finite set \(\mathrm{S}, f: S \rightarrow S\) is non-identity function, then it can be injective only or surjective only or both or none.
So, data is insufficient to answer.
Hence, option (d) is correct.