The time complexity of the code

Data: Input value $n$

Result: Print all pairs of numbers from $1$ to $n$

for $i$ in range $(1,n+1)$ do

for $j$ in range $(1,log(n)+1)$ do

print $($i$,$ j$)$;

end

end

Select one:

a$.O($nlgn$)$

b$.O(n^{2}lgn)$

c$.O(n)$

d$.O(n^2)$