Consider the program
void function (int n) {
int i, j, count = 0;
for (i = n/2; i <= n; i++)
for (j = 1; j <= n; j = j * 2)
count++;
}
The complexity of the program is

A

$$O(\log n)$$

B

$$O(n^2)$$

C

$$O(n^2 \log n)$$

D

$$O(n \log n)$$