A student wants to design and implement a Python program to generate a Fibonacci sequence of a given length and then to find the sum of the values. There are many ways of doing this, but here is their initial top$-$level decomposition.

$>$Sum the values of a Fibonacci sequence of a given length

$>>$Input an initial list of the first two Fibonacci numbers $(1$and $1)$

$>>$Input the number, n$,$of Fibonacci numbers to be generated

$>>$Generate a list of n Fibonacci numbers

$>>$Find the sum of n Fibonacci numbers in the list

$>>$Print the result

a$.$In this part, you will consider only this part of the top$-$level decomposition:

$>$Sum the values of a Fibonacci sequence of a given length

$>>$Input an initial list of the first two Fibonacci numbers $(1$and $1)$

$>>$Input the number, n$,$of Fibonacci numbers to be generated

$>>$Generate a list of n Fibonacci numbers