Intelx86 assembly language program

are already familiar with the Fibbonaci Sequence and how to calculate the nth number: 0,1,1,2,3,5,8,13 The sequence starts with the starting numbers 0 and 1 ; each succeeding number is simply the sum of the previous two numbers. In class, I demonstrated a program that calculated the nth Fibonacci number. It had two variables under the data section called niterations which was initialized to an integer that we would like n to be, and nthFibNumber which was initialized to 0 , but later set to contain the nth Fibonacci number. It utilized a loop called fibloop that stored n tterations in ecx and decremented in each iteration. Once ecx reached zero, it exited the loop. Modify this program in the following way: - Rather than using 0 and 1 as startring numbers, declare your own custom numbers to construct your own Fibonacci sequence. In the data section, declare two seed numbers called seedZero and seedOne that can be set to any integer. a. Copy-paste the code that you've written into this section: b. Test your program by setting seedZero and seedOne to 5 and 7 respectively. Also set nlterations to 8 to signify that you are retrieving the nth custom Fibonacci number. Add a breakpoint to debug (as we've done in video) and examine the registers to ensure that the correct value is being placed in nthFibNumber. Take a screenshot of the registers and place it here