煩請幫我解答以下題目: 十分感激!?

It's big-Oh is O(log n). This conclusion can be easily derived by deduction process on value k.

When K = 0. O(log 1) is true.
That "K = m, O(log 2^m) is true" implies "k=m+1, O(log 2^(m+1))" is also true.