define iteration.

For function log, write the missing base case condition and the recursive call. This function computes the log of n to the base b. As an example: log 8 to the base 2 equals 3 since 8 = 2*2*2. We can find this by dividing 8 by 2 until we reach 1, and we count the number of divisions we make. You should assume that n is exactly b to some integer power. Examples: log(2, 4) -> 2 and  log(10, 100) -> 2   public int log(int b, int n ) {  if <<Missing base case condition>> {    return 0;  } else {    return <<Missing a Recursive case action>>  }}

Give an overview of the analysis of the aho-Corasick algorithm for running time and memory consumption for below patterns : 1. TGCGATA2. TGTG3. AAAG4. CCTCT5. AAGG

Given the recursive function definition:t(n) = n+ 3 * t(n-1) + t(n-2) t(0) = 2 t(1) = 1a. Evaluate: t(3)b. Write the source code to implement this function