2. The derivation of Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, 21, ... (FIB(N – 1) + FIB(N – 2) If N> 2 FIB(N)= 1 If N = 2 1 If N = 1

Recursive formulation algorithms

Extracted text: 2. The derivation of Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, 21, ... (FIB(N – 1) + FIB(N – 2) If N> 2 FIB(N)= 1 If N = 2 1 If N = 1


Extracted text: By using recursive approach perform the following first 3 problems by using functions in Java Anlyse their working mechanisms and check their correctness Comment on their T(n)