Complete the Jasmin file fib.j so that it prints
out the first 30 Fibonacci numbers. You might base your
solution on the following iterative pseudocode program
(from Discrete Mathematics and its Applications,
by Kenneth H. Rosen):
procedure iterative fib(n: nonnegative integer) {
if n = 0 then y := 0
else {
x := 0
y := 1
for i := 1 to n-1 {
/* Here, y is the ith Fibonacci number */
z := x + y
x := y
y := z
/* Here, y is the (i+1)th Fibonacci number */
}
}
/* Here, y is the nth Fibonacci number */
}