Big$-$Oh and Run Time Analysis: Describe the worst case running time of the following pseudocode functions in Big$-$Oh notation in terms of the variable n$.$

Function$($int n$,$ int x$,$ int y$)\{$

for $($int k$=$n; k $>0$; k$--)$

if $($ x $<$ y $+$ n$)\{$

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

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

print$()$;

$\}$

else

print$()$;

$\}$

Function$($int n$)\{$

for $($int i$=0$; i $>$ n; i$++)\{$

for $($int j$=0$; j $>$ n; j$++)$

print$()$;

for $($int k$=0$; k $<$ i; $++$k$)\{$

print$()$;

for $($int m$=0$; m $<100$; $++$m$)$

print$()$;

$\}$

$\}$

$\}$