Suppose there are two different algorithms, ALG1 and ALG2, for solving the same problem. The running time of ALG1 is (n2) for any instance. The best-case running time of ALG2 is O(n) and the worst-case running time of ALG2 is (n3) Which of the following is true? ALG2 is more efficient than ALG1. The running time for ALG1 is O(n) for any instance. ALG1 is more efficient than ALG2. The running time for ALG2 is (n3) for any instance