Suppose that there are $n = 2^k$ teams in an elimination tournament, where there are n/2 games in the first round, with the $n/2 = 2^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.

Would $f(n) = f(n/2) + 1$ for $n=2^k$ be a recurrence relation for the question above? would I also have to say $f(1) = 1?$