B. Develop a pseudocode C. Develop a flowchart D. Write Octave code / debug E. Report the solution and the error Q 2.5 - (20 points) The Fibonacci sequence is given by a recursive equation Fk+1 = Fx +Fx-1 with Fo=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 lim = 4,3 = 1.618033988749895... Write a for-loop (start=1, step=1, and finish=20) program of the Fibonacci sequence. Within the for-loop block, use if-command to print the following (ONLY). (Hint: For decision-condition in if-command use "if k=r15" NOT k=5. For checking equality use double equal sign) Golden Ratio from Fibonacci Sequence Terms added: 15 Golden Ratio Approx: 1.61803 Approximation error: 0.0028 True error: 0.001% Command Window Documentation Variable Editor