Python: Fill your codes at the places marked xxx.

In mathematics, the Fibonacci numbers, commonly denoted F(n), form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, FO) = 0, F(1)= 1 and F(n) = F(n-1) + F(n-2_for n>1. The beginning of the sequence is thus: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... For more details, see https://www.mathsisfun.comumbers/fibonacci-sequence.html Fill in your codes at the places marked XXX Algorithm A: Iterative Approach in Linear Time Use a iterative for-loop to compute the Fibonacci numbers with the following formula F(0) = 0, F(1)= 1 and F(n) = F(n-1) + F(n-2_ for n>1. The pseudo code is provided below Your program should also count the number of operations (additions) used The number of operations used should be O(n) for computing F(n) def fib_linear(n): F[0] = 0; F[1] = 1; for i = 2 to n F[i] = F[i-1] + F[i-2]; # F[2]=1, F[3]= 2, F[4)=3, .... Return F[n]; In [54]: # xxx you may add more function codes here def fib_linear(n): "" "Compute by eration the n_th term of Fibonacci sequence in linear Time input: integer n >=0 output: fibn: the n_th term of Fibinacci sequence count: number of the integer additions used. count = 0 fibn = 0 # xxx fill in the codes below return fibn, count