The function F FF is defined on the set of nonnegative integers and takes nonnegative integer values satisfying the following conditions: for every n≥0, n \geq 0,n≥0,
(i) F(4n)=F(2n)+F(n), F(4n) ={} F(2n) +{} F(n),F (ii) (iii)
Prove that for each positive integer m, m,m, the number of integers n nn with 0≤n<2m 0 \leq n < 2^m0≤n<2m and F(4n)=F(3n) F(4n) ={} F(3n)F(4n)=F(3n) is F(2m+1). F(2^{m +{} 1}).F(2m+1).