Question

Let A be the set of all binary strings of length four. Define a function that maps A to the set {0, 1, 2, 3, 4} by letting f(s) be what you get when you add up the digits making up the string s. Then the function f is not one-to-one

Answer 1

Answer:

  see the attachment

Step-by-step explanation:

One way to define the function is to list the output for each possible input. That is done below.