Analyze the following pseudocode and give a tight $(\backslash$Theta $)$ bound on the running time as a function of n$.$ You can assume that all individual instructions $($including logarithm$)$ are elementary, i$.$e$.,$ take constant time. Show your work.

l :$=0$;

For i$=$n$+1$ to n$^2$ do

for j$=1$ to $$logi$$

do l:$=$ l$+1$

od od$.$