Take the foilowing list of functions and arrange them in ascending order

of growth rate. That is$,$ if function g$($n$)$ immediately follows function f$($n$)$

in your list, then it should be the case that f$($n$)$ is O$($g$($n$)).$ f$1($n$)=$ n$^2\mathrm{.}5$