Compute the running time $($Big$-$O$)$ and provide an analysis of the following Code Snippet: x $=100-50$;

for$($int c $=0$; c $<$ n; c$++)$ System.out.print$($x$)$; for$($int d $=0$; d $<$ n; d$++)$ for$($int e $=0$; e $<$ n; e$++)$ System.out.print$($e $+$ c$)$;