Analyze the time complexity of the following code snippets using Big O notation

Algorithm $2$ Pseudocode $2$

$1$: x $0$

$2$: for $($i $=1,$ i $<=$ n$,$ i $++)$ do

$3$: for $($j $=1,$ j $<=$ n$,$ j $++)$ do

$4$: x $$ x$2$

$5$: n $$ n $1$

$6$: end for

$7$: end for