When n is a power of 2, what is the correct function of n, T(n) that gives the number of times the operation "print("Hello")" is executed in the following part of an algorithm: inti-1; while (i = 1) { print("Hello"); 1 - ] -2: } 1-1 +2: } on-20 nog n) + 1 On + n/2 on212 None of the above