Consider the situation that there are two algorithms A$1,$ A$2$ and attempting to solve the same problem P$.$ Furthermore, say that the

asymptotic time complexity of A$1$ is theta$(2^$n$)$ while the asymptotic time complexity of A$2$ is theta$($n$^2).$

In this context, assume that "efficiency" refers to asymptotic runtime only, not space considerations.

Given all of the above, indicate whether the following statement is TR

UE or FALSE:

"Algorithm A$1$ is more efficient than algorithm A$2."$