Assume evaluating a function f(k) in the pseudocode below takes (logk) time, for any k, an integer number in [0, n]. What is the running time (use an asymptotic notation) of the following code? Justify your answer.

1. i = 1; 2. sum = 0; 3. while (i <= n) 4. sum += f(i); 5. i=i+1;