Count the number of operations in the below code as precisely as you can, and give the best asymptotic complexity analysis of it.

int count = 0;

for (int i = 1; i <= n; i++)

for (int j = 1; j <= n; j = j * 2)

for (int k = 1; k <= j; k++)

count++;

return count;