Assume you have two algorithms, A and B, which perform the same function even though their implementations differ.

Algorithm A has a running time of O2n2+21n+127.

Algorithm B has a running time of O(n2+51n+71).

Answers may be in the form of an inequality if necessary.

1. What values of n will make algorithm A more efficient than algorithm B? (A < B)
2. What values of n will make algorithm A less efficient than algorithm B? (A > B)
3. What values of n will make algorithm A operate with the same time efficiency as algorithm B? (A = B)