One mapping is se

We know that the no of mapping from a set A to same set containing n elements = nⁿ

As each element have n options to be mapped with n elements.

For mapping selected to be one to one, for first element we have n options ,for second we have n-1 options an so on…

∴ total such mappings = n × (n-1)× (n-2)× … = n!

∴ P(mapping is one to one) =

Our answer matches with option (c)

∴ Option (c) is the only correct choice