With DLX Assembler

Hallo who can Help me The Fibonacci sequence (1; 1; 2; 3; 5; 8; :: :) is a mathematical sequence of integers with the first two Consequences members 1 and all other members of the sequence are the sum of the two preceding each Resulting members result. The n-th Fibonacci number f (n), where n N, can be found as follows to calculate: f (1) = 1 f (2) = 1 f (n) = f (n -1) + f (n-2); if n> 2 Write an assembler program containing all Fibonacci numbers <2^31 in ascending order in memory from address 1000 writes. Pay attention to correct handling of the number range, in particular also that no element of the Fibonacci sequence unintentionally as a negative number is interpreted. In register R1 at the end of the last stored sequence term corresponding n stand, that is to say n, for which the following applies: f (n) <2^31<= f (n + 1).