analyze the given nested loop and determine its time complexity and big$-$O notation. for $($int i $=1$; i $<=$ n; i$++)\{$

for $($int j $=1$; j $<=2$i; j $+=2)\{$

$//5$ assignments

$\}$

for $($int k $=1$; k $<=3$n $+1$; k$++)\{$

$//2$ assignments

$\}$

$\}$