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

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