(You are only allowed to use the following functions/methods: print(), range(), len(), sum(), max(), min(), and .append()) You will be adjusting the Fibonacci Sequence code down below. You will be creating a Fibonacci Sequence where the numbers that are present in the sequence are generated using the rnd() function, including the first two digits in the sequence. For simplicity, we will assume your Fibonacci Sequence function will always produce a sequence with 10 digits. You will create a new function that takes all adjacent values from the sequence and finds their average value. The average values are then inserted into a list which will be the output of this code. For example, if we have the following sequence: [0, 1, 2, 3, 4, 5], the output of your averaging function will be [0.5, 1.5, 2.5, 3.5, 4.5]. def fibonacci_sequence(num_terms):     # Initialize the first two terms of the sequence     fib_seq = [0, 1]          # Compute and append the next term for each term up to num_terms     for i in range(2, num_terms):         next_term = fib_seq[i-1] + fib_seq[i-2]         fib_seq.append(next_term)          # Display the resulting sequence     print(fib_seq)      # Test the function by computing and displaying the first 10 terms of the sequence fibonacci_sequence(10)

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
icon
Related questions
Question

(You are only allowed to use the following functions/methods: print(),
range(), len(), sum(), max(), min(), and .append())

You will be adjusting the Fibonacci Sequence code down below. You will be creating a Fibonacci Sequence where the numbers that are present in the sequence are generated using the rnd() function, including the
first two digits in the sequence. For simplicity, we will assume your Fibonacci
Sequence function will always produce a sequence with 10 digits.
You will create a new function that takes all adjacent values from the sequence and
finds their average value. The average values are then inserted into a list which will
be the output of this code. For example, if we have the following sequence:
[0, 1, 2, 3, 4, 5], the output of your averaging function will be
[0.5, 1.5, 2.5, 3.5, 4.5].

def fibonacci_sequence(num_terms):
    # Initialize the first two terms of the sequence
    fib_seq = [0, 1]
    
    # Compute and append the next term for each term up to num_terms
    for i in range(2, num_terms):
        next_term = fib_seq[i-1] + fib_seq[i-2]
        fib_seq.append(next_term)
    
    # Display the resulting sequence
    print(fib_seq)
    
# Test the function by computing and displaying the first 10 terms of the sequence
fibonacci_sequence(10)

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Print statement
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education