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

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

Algorithm $2$: $g(n)=51n+17$

Determine at what integer value of $n,$ algorithm $2$ becomes more efficient than algorithm