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