Write the Recurrence Formula for the TIME COMPLEXITY of this function, including the base cases for N>=0. You do NOT need to solve the recurrence. Remember not to confuse the time complexity of the function with what the function calculates.

int foo(int N)t if (N -0. You do NOT need to solve the recurrence. Remember not to confuse the time complexity of the function with what the function calculates. 2. Draw the tree that shows the function calls performed in order to compute foo(5) (the root will be foo5) and it will have a child for each recursive call.) Also show what each call returns by using an arTow pointing back from the child to the parent