We will determine the runtime of the following recursive We will determine the runtime of the following recursive algorithm. This algorithm takes two $-$ digit integers a and $($ as strings $)$ and determines if algorithm. This algorithm takes two n $-$ digit integers a and $($ as strings $)$ and determines if $()=$ LTRec $(12...,12...)$ : $==1$ : $1<1$ : $$ return TRUE $$ else $$ return FALSE $1<1$ : $$ return TRUE else $1<1$ : $$ return FALSE else $1==1$ : $$ return LTRec $(2....,2....)$can write a recurrence for the runtime $$this algorithm $()=()$ Blank $1\{1$Options: $(-1)+,(1)=(-1)+$base case $(-1)+(-1)+,(1)=(2)+*2,(1)=(-1)+,(1)=1\}$ From this, $$can conclude a tight Big $-$bound for this algorithm's runtime is $\_\_\_\_\_$ Blank $2\_\_\_\_\{$ Blank $2$Options: O $($ n $)$ O $($ log n $)$ O $(1)$ O $($ n $^2)$ O $($ n log n $)\}$