$1-$ Consider the following function :

f $($n$)=5$n$6-2$n$4+33$

$$For which positive integer T can you say that :

f$($n$)$ is$$ O$($nT$)$

f$($n$)$ is$($nT$)$

f$($n$)$ is$($nT$)$

$2-$ Count the number of basic operations in the following method, if you

$$call the$$ method with Trace$(29,3)$ :$$

int$$ Trace$($ int n $,$ int m $)$

$\{$ int x ;

$$ if $($n $<$ m $)$ return n ;

$$ else

$\{$ x $=$ Trace $($ n $$ m $,$ m $)$;

return$$ x$*1$;

$\}$

$\}$