To analyze the function $f: \mathbb{Z} \to \mathbb{N}, n \mapsto |n|$:

1. Injective (One-to-One): A function is injective if different inputs map to different outputs. Here, both $f(-1) = 1$ and $f(1) = 1$. Therefore, $f$ is not injective.

2. Surjective (Onto): A function is surjective if every element in the codomain (in this case, $\mathbb{N}$) is covered. The outputs of $f$ include every natural number (1, 2, 3, ...), so $f$ is surjective.

3. Bijective: A function is bijective if it is both injective and surjective. Since $f$ is not injective, it cannot be bijective.

Based on this analysis, the correct classification is:

• Injective: No
• Surjective: Yes
• Bijective: No

Thus, the correct answer is "No; Yes; No."

If you have any questions or need further details, feel free to ask! Here are some related questions you might consider:

1. What are some examples of injective functions?
2. Can a function be surjective but not injective?
3. How do we determine if a function is bijective?
4. What are the implications of a function being neither injective nor surjective?
5. Can you give examples of bijective functions?

Tip: When analyzing functions, always start by checking injectivity, as it helps quickly identify many properties of the function.