Suppose there are two different algorithms, ALG$1$ and ALG$2,$ for solving the same

problem. The running time of ALG$1$ is $(nlogn)$ for any instance. The best$-$

case running time of ALG$2$ is $(n)$ and the worst$-$case running time of ALG$2$ is

$(n^2).$

Which of the following is true?

The running time for ALG$2$ is $(nlogn).$

ALG$1$ is more efficient than ALG$2.$

The running time for ALG$1$ is $O(n).$

ALG$2$ is more efficient than ALG$1.$