Use the Big O notation to determine the runtime complexity of the following algorithms.

for $($int i $=0$; i $<$ n; i$++)$

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

for $($int k $=1$; k $<$ i $*$ j; k $+=2)$

System.out.println$($i$+$j$+$k$)$;