Using the Big O notation, estimate the time complexity of the code below. Briefly explain how you derive your answer.

int count = 1; while (count < n) { count = count * 2; }