6.32 LAB: Fibonacci sequenceThe Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, ex: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which has an index n as parameter and returns the nth value in the sequence. Any negative index values should return -1.Ex: If the input is:7the output is:fibonacci(7) is 13Note: Use a for loop and DO NOT use recursion.Use Python, please. LAB6.32.1: LAB: Fibonacci sequence0/ 10ACTIVITYmain.pyLoad default template..1 def fibonacci(n):2# Type your code here.345 ifnamemain ':start_num = int(input())print('fibonacci({}) is {}'.format(start_num, fibonacci(start_num)))|7

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

6.32 LAB: Fibonacci sequence

The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, ex: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which has an index n as parameter and returns the nth value in the sequence. Any negative index values should return -1.

Ex: If the input is:

the output is:

fibonacci(7) is 13

Note: Use a for loop and DO NOT use recursion.

Use Python, please.

LAB
6.32.1: LAB: Fibonacci sequence
0/ 10
ACTIVITY
main.py
Load default template..
1 def fibonacci(n):
2
# Type your code here.
3
4
5 if
name
main ':
start_num = int(input())
print('fibonacci({}) is {}'.format(start_num, fibonacci(start_num)))|
7

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions