$3.$ Consider the following code segment:

Initialize x $=0$

for $($i $=1$; i $<=$ n; i$++)\{$

for $($j $=1$; j $<=$ n; j $+=$ i$)$

x $=$ x $+1$;

$\}$

Analyze the running time of the code in terms of n$.($Use $\backslash$Theta $-$notation.$)$