For the following recursive function, find the recurrence relation f(n) for the time it takes on...

 

• 
  

Transcribed Image Text:

For the following recursive function, find the recurrence relation f(n) for the time it takes on input size n. Then, solve the recurrence relation using the method of your choice, putting your answer in 0-notation (Theta-notation). void foobar(int n) { } if (n == 1) return; foobar(n-1); cout < < "switch on branch " < < n < < endl; foobar(n-1); For the following recursive function, find the recurrence relation f(n) for the time it takes on input size n. Then, solve the recurrence relation using the method of your choice, putting your answer in 0-notation (Theta-notation). void foobar(int n) { } if (n == 1) return; foobar(n-1); cout < < "switch on branch " < < n < < endl; foobar(n-1);