One of the simplest questions that one can face in a Math interview.
This question involves the concept of one-one and onto function.
A function is said to be a one-one function if distinct elements in domain have distinct images under the function f.
A function is said to be an onto function if for every element in the codomain there exist pre-image in the domain.
We will see examples of functions which are:
1. one-one and onto both
2. one-one but not onto
3. neither one-one nor onto
3. Onto but not one-one