Section 2.1

• 12.
• 18. Let array hit keep track of which elements of the codomain B have already been found to be images of elements of the domain A. When we find an element that has already been hit being hit again, we conclude that the functions is not one-to-one. Now write out the procedure in pseudocode.
• 20.
• 26. Find all terms of a finite sequence of integers that are greater than the sum of all the previous terms. Just keep a running sum and compare to each element is sequence. Now write the pseudocode.