Time complexity of algorithm1 is T (n^2) and that of algorithm2 is T (n).Then which of the following statements are true?
Algorithm1 beats algorithm2 when n tends to infinity
Algorithm2 beats algorithm when n tends to infinity
Nothing can be said about the performance of both algorithms for lower values of n
Algorithm1 performs the same as algorithm2