If the exercise has parts (a), (b), (c), etc., label each part of your solution and include the exercise questions for these parts as well. Provide any formulas you'll use in your computation(s) or summarize your strategy in a sentence prior to any computations. This will help the reader know why you're performing the computation. Show all steps using material from this class. If you use material from another class that isn't a prerequisite, provide the relevant definition or theorem so that someone from this class could learn from your solution. Think about this step as showing me how much of the material you've learned, or write a solution so that another student in class who doesn't know how to solve the exercise could learn from your solution. Answers without justification will receive 0 points. Write a conclusion either using a sentence (preferred for an application exercise, like a word problem) or symbolically to summarize what your work shows.

3. Determine if the following statements are true or false. If true, justify (or prove) the claim. If false, provide a counterexample. (a) If f : A B is a surjective function, then f is invertible. (b) Suppose |A|,|B| N. If there exists a bijection f : A B, then |A| = |B]