Answer:
(D) t^4
Step-by-step explanation:
You have defined ...
a3 = a2·a1
a4 = a3·(a2·a1) = a3²
a5 = a4·(a3·a2·a1) = a4² = (a3²)² = a3⁴
Then if a3 = t, a5 = t⁴
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
Answer:
Every decade, the number of species decays by a factor of 0.0834.
Step-by-step explanation:
Let be 
, 
. The decay rate per decay is deducted from the following relation:
Every decade, the number of species decays by a factor of 0.0834.
