TL 7. Consider the function f N-N given by f(n)- 3u+1. if n is odo 3n +1, if n is odd (a) Is f injective? (b) Is f surjective? (c) For f(12), how many iterations of the function does it require until the output is 1? (d) For any initial n, does the process of repeatedly plugging in the answer eventually reach 1? 8. In the game of Hearts, four players are each dealt 13 cards from a deck of 52. Is this a function? If so, what are the domain and codomain? Is the function injective, surjective, both (bijective), or neither? TL 7. Consider the function f N-N given by f(n)- 3u+1. if n is odo 3n +1, if n is odd (a) Is f injective? (b) Is f surjective? (c) For f(12), how many iterations of the function does it require until the output is 1? (d) For any initial n, does the process of repeatedly plugging in the answer eventually reach 1? 8. In the game of Hearts, four players are each dealt 13 cards from a deck of 52. Is this a function? If so, what are the domain and codomain? Is the function injective, surjective, both (bijective), or neither