What is the time complexity of the following algorithm?

$)=1$;$i(n$;$i++)=1$;$j(n$;$j++)=1$;$k(n$;$k++$

$O(n^3)$

$)$

$O(n)$

$O(n^2)$