What are the time complexity and space complexity of this function? int f(int n) { } int sum = 0; for(int i = 0; i < n; i=i*2) { sum += 1; } return sum;