Assembly Using NASM (32-bit)

Please create a solution using NASM for the following problem. Most of what you to complete this problem is through Chapter 5. Do not worry about I/O. use your debugger to ensure the final result is in a register or variable. Be sure to comment your code extensively. If you use a register to store the final sum, use edx. If you use a variable, call it sum with size dd.

Fibonaccis revenge :: Write a program that calculates the sum of all odd numbers in the Fibonacci sequence between 0 and 1,000,000. Note: A Fibonacci sequence is a sequence of numbers that starts with non-negative integers and generates the next term in the sequence by the sum of the previous two terms in the sequence. Use the following traditional Fibonacci sequence to solve this problem. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...