Suppose the number of steps required in the worst case for two algorithms are as follows:
Suppose the number of steps required in the worst case for two algorithms are as follows:
- Algorithm 1: f(n) = 10n2 + 6
- Algorithm 2: g(n) = 21n + 7
Determine at what point algorithm 2 becomes more efficient than algorithm 1.