Suppose the number of steps required in the worst case for two algorithms are as follows:

$$ Algorithm $1$: f$($n$)=3$n$2+9$