# Question: 7 let s be the set of bit strings and...

###### Question details

7. Let S be the set of bit strings and Z be the set of integers. Determine if f is the function from S to Z if given a string s

- f(s) is the position of a 0 bit in s.
- f(s) is the number of 1 bits in s.
- f(s) is the smallest integer
*i*such that the*i*th bit of S is 1 and f(0) = 0 when S is the empty string.