For question below complete the following 5 steps: A. Fransform engineering problem into NA problem B. Develop a pseudocode C. Develop a flowchart D. Write Octave code / debug E. Report the solution and the error Q 3.5 - (25 points) Problem from HW2 but using arrays and plotting The Fibonacci sequence is given by a recursive equation F = F. + F k+1 k k-1 with F, = 0 and F, = 1 i.e., the next value is the sum of previous two values i.e. {0, 1, 1, 2, 3, 5, 8, 13,...}. As k gets larger, the ratio of adjacent values approaches the golden ratio given by F k F k-1 = lim k 00 1+15 2 = 1.618033988749895... Write a for-loop (start=1, step=1, and finish=20) program of the Fibonacci sequence. Plot the values of Fibonacci numbers, golden ratio, true error, and approximation error for first 10 iterations. For question below complete the following 5 steps: A. Fransform engineering problem into NA problem B. Develop a pseudocode C. Develop a flowchart D. Write Octave code / debug E. Report the solution and the error Q 3.5 - (25 points) Problem from HW2 but using arrays and plotting The Fibonacci sequence is given by a recursive equation F = F. + F k+1 k k-1 with F, = 0 and F, = 1 i.e., the next value is the sum of previous two values i.e. {0, 1, 1, 2, 3, 5, 8, 13,...}. As k gets larger, the ratio of adjacent values approaches the golden ratio given by F k F k-1 = lim k 00 1+15 2 = 1.618033988749895... Write a for-loop (start=1, step=1, and finish=20) program of the Fibonacci sequence. Plot the values of Fibonacci numbers, golden ratio, true error, and approximation error for first 10 iterations