4. (12 points): Analyze the following function in terms of time complexity: long int Fibonacci(int N) (N0)) if ((N 1) return 1; return (Fibonacci(N-1) + Fibonacci(N-2)) 4(a) (6 points): Complete the following table where Fibonacci) should represent the number of calls to the Fibonacci function for any given value of N. Also fill in the table with data corre- sponding to the other functions of N NFibonacci(O N! 2 4 4 24 120 720 5040 40320 362880 3628800 4. 10 4(b) (2 points): Based on the data of the table above, what is the time complexity of Fibonacci() in 0 () notation? Explain your reasoning. Recall that 0() is a "tight" upper bound on the complex- ity of an algorithm