Calculate the run$-$time efficiency of the following program segment:

$i=1$

$lp(in)$

$j=1$

$lp(jn)$

$k=1$

$lp(kn)$

print$(i,j,k)$

$k=k+1$

end loop

$j=j+1$

end loop

$i=i+1$

end loop

$,O(n^2(\frac{n+1}{2}))$

$O(3n)$

$O(lo{g}_3(n))$