Task D In C++

Task D. Computing Fibonacci Numbers with Loops and Arrays 0, 1,1, 2,3, 5,8,13.. First, a quick intro: Fibonacci numbers is a sequence of numbers that starts with F(0)0 and F(1)-1, with all the following numbers computed as the sum of two previous ones, F(n)- F(n-1) +F(n-2) 5 (-3+2) 8 (5+3) 13 (-8+5) and so on.. To make a C++ program to keep track of the previous numbers so that we can compute the new ones, we can use an array of integers make an array int fib[60]; /first two terms are given fib[1] 1 and all the following ones can be computed iteratively as