Q$)$ prove that the function $f(n)$ has a Big$-$O complexity of $g(n),$ where :

a$)f(n)=17n^2+6n+8$ and $g(n)$:$n^2$

b$)f(n)=3n^3+5n^2+2n+4$ and $g(n)=n^3.$

c$)f(n)=50n^2+30nlogn+25n$ and $g(n)=n^2.$

e$),f(n)=3^n+10n^2,g(n)=3^n$

f$)f(n)=200nlogn+300n+500,g(n)=nlogn$