1. Write recursive run-time function T(N) for the following function and solve it:

   int fibonacci(int N){ if (N <= 0) return 0; else if (N==1) return 1; return fibonacci(N-1)+fibonacci(N-2);