Let f be a function on non-negative integers defined as follows f(2n)=f(f(n)) and f(2n+1)=f(2n)+1
(a) If f(0)=0 , find f(n) for every n.
(b) Show that f(0) cannot equal 1.
(c) For what non-negative integers k (if any) can f(0) equal 2k ? functional equationnumber theorycombinatorics