4. Write a tail recursive function that returns the nth number in Fibonacci series, assuming first

2 numbers to be 1, 1.