Suppose that with an input of size n, algorithm A requires 2…
Suppose that with an input of size n, algorithm A requires 2000n operations and algorithm B requires n2 operations. For what values of n is algorithm B more than four times as efficient as algorithm A?