4. The Fibonacci sequence are the numbers in the following integer sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... The first two numbers are and 1 and each subsequent number is the sum of the previous two. Write a program that asks the user to enter a positive integer number n and then prints the nth number in the Fibonacci sequence. The following algorithm can be used: Input: n positive integer Output: nth Fibonacci number Fibe0Fib1 = 1 for (i=2; i 0) fib= fibl else fib= 0