Asymptotic notations / time complexity closed

Question

int unknown(int n) {
inti, j, k = 0;
for (i = n/2; i<= n; i++)
for (j = 2; j <= n; j = j * 2)
k = k + n/2;
return k;
}
What is the returned value of the above function? (GATE CS 2013)
(a) Ѳ(n2) (b) Ѳ(n2 log n)
(c) Ѳ(n3) (d) Ѳ(n3 log n)

Comments

https://gateoverflow.in/1542/gate2013_31

---

Option (B) is the correct according to the question