Please follow the pseudocode...... If you can not do it as pseudocode then just leave it. thnx

X Pseudocode: An Iterative Algorithm for Fibonacci Numbers. 1 procedure iterative fibonacci(n: nonnegative integer) 2 if n=0 then 3 return 0 4 else 5 := 0 6 7 for i 1 to n - 1 8 := x + y 9 := y 10 11 return y 12 { output is the nth Fibonacci number} y := 1 : Z X : Z