Consider the situation that there are two algorithms $1$

and $2$

attempting to solve the same problem $$

$.$ Furthermore, say that the asymptotic time complexity of $1$

is $\backslash$Theta $($log$)$

while the asymptotic time complexity of $2$

is $\backslash$Theta $(1)$

$.$

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 TRUE or FALSE:

"Algorithm $1$

is more efficient than algorithm $2$

$."$