In terms of n, the parameter,
write a recurrence representing the amount of time taken by
the below recursive algorithm. You can use variables
C and D to represent constants that will
vary from computer to computer.
if n <= 1:
return recur(n - 1) + recur(n / 2)