Fibonacci numbers : 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89

the sequence Fn of Fibonacci numbers is defined by: Fn = Fn-1 + Fn-2

where F0 = 0 and F1 = 1.

1- Write down the algorithmic routines needed to implement the above Fibonacci equation using both sequential and pipeline Computations

2- Make the necessary analysis to calculate the time complexity using sequential programming

3- Make the necessary analysis to calculate the time complexity using parallel programming