Big O complexity in recursive method

Question

For f(n) = f(n/2) + 1 where n is power of 2 (n >= 2),

with f(1) = 1,

Is it going to be

f(n) =