Determine whether f is a function from the set of all bit strings to the set of integers if a) f(s) is the position of a 0 bit in s. b) f(s) is the number of 1 bits in s c) f(s) is the smallest integer i such that the ith bit of s is 1 and f(s) = 0 when s is the empty string, the string with no bits

add an image, and i will answer

step-by-step explanation:

answer: 4 meters

step-by-step explanation: to you understand 2/3 better you can do 1 divided by 3 = . then multiply that by the 2 which is .66666666666666667 then you would do 6 x .66666666666666667 which is 4.      

hope this .

answer:   2 multiplied by x =24

step-by-step explanation: