FIB 3 FIB ( n 1 ) 3 FIB ( n 2 ) FIB ( n 3 ) ADD R 6 , R 6 , 1 STR R 7 , R 6 , 0 push return addr ADD R 6 , R 6 , 1 STR R 5 , R 6 , 0 push prev frame ptr ADD R 5 , R 6 , 0 BASE CASES checking n 0 LDR R 0 , R 5 , 3 BRnp END IF 0 ADD R 0 , R 0 , 1 STR R 0 , R 5 , 2 BRnzp RETURN FIB END IF 0 checking n 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 1 BRnp END IF 1 ADD R 0 , R 0 , 3 STR R 0 , R 5 , 2 BRnzp RETURN FIB END IF 1 checking n 2 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 2 BRnp END IF 2 ADD R 0 , R 0 , 6 STR R 0 , R 5 , 2 BRnzp RETURN FIB END IF 2 ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 1 STR R 0 , R 6 , 0 push argument ( n 1 ) ADD R 6 , R 6 , 1 push return value JSR FIB LDR R 0 , R 6 , 0 return value ADD R 1 , R 0 , R 0 ADD R 0 , R 0 , R 1 3 FIB ( n 1 ) STR R 0 , R 5 , 2 put in return value x 5 FF 8 2 x 5 FFA ADD R 6 , R 6 , 1 pop return value ADD R 6 , R 6 , 1 pop arg ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 2 STR R 0 , R 6 , 0 push argument ( n 2 ) ADD R 6 , R 6 , 1 push return value JSR FIB LDR R 0 , R 6 , 0 return value ADD R 1 , R 0 , R 0 ADD R 0 , R 1 , R 0 3 return value 3 FIB ( n 1 ) 3 FIB ( n 2 ) LDR R 1 , R 5 , 2 NOT R 0 , R 0 ADD R 0 , R 0 , 1 two's ADD R 0 , R 0 , R 1 STR R 0 , R 5 , 2 x 5 FF 8 2 x 5 FFA ADD R 6 , R 6 , 1 pop return value ADD R 6 , R 6 , 1 pop arg ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 3 STR R 0 , R 6 , 0 push arg ( n 3 ) ADD R 6 , R 6 , 1 return value JSR FIB LDR R 0 , R 6 , 0 return value ADD R 6 , R 6 , 1 popping rv ADD R 6 , R 6 , 1 pop arg LDR R 1 , R 5 , 2 ADD R 0 , R 0 , R 1 STR R 0 , R 5 , 2 complete calc and put return value x 5 FF 8 2 x 5 FFA RETURN FIB LDR R 5 , R 6 , 0 ADD R 6 , R 6 , 1 pop prev frame ptr LDR R 7 , R 6 , 0 ADD R 6 , R 6 , 1 pop return address RET help fix this code to get the desired outputs for 1 9 F ( 0 ) 0 F ( 1 ) 1 , I am getting 3 F ( 2 ) 1 , I am getting 6 F ( 3 ) 2 , I am getting 1 0 F ( 4 ) 3 , I am getting 1 5 F ( 5 ) 5 , I am getting 2 1 F ( 6 ) 8 , I am getting 2 8 F ( 9 ) 3 4 , I am getting 5 5

The Answer is in the image, click to view ...

Question: FIB ; 3 * FIB ( n - 1 ) - 3 * FIB ( n - 2 ) + FIB ( n - 3

FIB

;

3 *

FIB

(

- 1) - 3 *

FIB

(

- 2) +

FIB

(

- 3)

ADD R

6,

6,

- 1

STR R

7,

6,

0

; push return addr

ADD R

6,

6,

- 1

STR R

5,

6,

0

; push prev frame ptr

ADD R

5,

6,

0

; BASE CASES

; checking n

= = 0

LDR R

0,

5,

3

BRnp END

_

_0

ADD R

0,

0,

1

STR R

0,

5,

2

BRnzp RETURN

_

FIB

END

_

_0

; checking n

= = 1

LDR R

0,

5,

3

ADD R

0,

0,

- 1

BRnp END

_

_1

ADD R

0,

0,

3

STR R

0,

5,

2

BRnzp RETURN

_

FIB

END

_

_1

; checking n

= = 2

LDR R

0,

5,

3

ADD R

0,

0,

- 2

BRnp END

_

_2

ADD R

0,

0,

6

STR R

0,

5,

2

BRnzp RETURN

_

FIB

END

_

_2

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 1

STR R

0,

6,

0

; push argument

(

- 1)

ADD R

6,

6,

- 1

; push return value

JSR FIB

LDR R

0,

6,

0

; return value

ADD R

1,

0,

0

ADD R

0,

0,

1

;

3 *

FIB

(

- 1)

STR R

0,

5,

2

; put in return value x

5

8 + 2 =

5

FFA

ADD R

6,

6,

1

; pop return value

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 2

STR R

0,

6,

0

; push argument

(

- 2)

ADD R

6,

6,

- 1

; push return value

JSR FIB

LDR R

0,

6,

0

; return value

ADD R

1,

0,

0

ADD R

0,

1,

0

;

3 *

return value

;

3 *

FIB

(

- 1) - 3 *

FIB

(

- 2)

LDR R

1,

5,

2

NOT R

0,

0

ADD R

0,

0,

1

; two's

ADD R

0,

0,

1

STR R

0,

5,

2

; x

5

8 + 2 =

5

FFA

ADD R

6,

6,

1

; pop return value

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 3

STR R

0,

6,

0

; push arg

(

- 3)

ADD R

6,

6,

- 1

; return value

JSR FIB

LDR R

0,

6,

0

; return value

ADD R

6,

6,

1

; popping rv

ADD R

6,

6,

1

; pop arg

LDR R

1,

5,

2

ADD R

0,

0,

1

STR R

0,

5,

2

; complete calc and put return value x

5

8 + 2 =

5

FFA

RETURN

_

FIB

LDR R

5,

6,

0

ADD R

6,

6,

1

; pop prev frame ptr

LDR R

7,

6,

0

ADD R

6,

6,

1

; pop return address

RET

help fix this code to get the desired outputs for

1 - 9

(0) = 0

(1) = 1,

I am getting

3

(2) = 1,

I am getting

6

(3) = 2,

I am getting

10

(4) = 3,

I am getting

15

(5) = 5,

I am getting

21

(6) = 8,

I am getting

28

(9) = 34,

I am getting

55

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Explain a planned or hypothetical Capital Budgeting project for Apple,Inc and estimate the cash flows (minimum of 7 years).Determine the WACC for the company and show the calculations; use this WACC...

H5 fx HE E F G H J L M N 1 2 Instructions: 1. Add correct formulas to the blank cells (referencing other cells where necessary) 2. Reformat all cells in order to make the Income Statement to the left...

2. Switch the notebook to Python3. Using a Python loop generate 21 files with the names samples_nnnn.dat for numbers nnnn every 50 between 0 and 1000. Make sure the numbers are padded with zeros so...

MOdel - 1. Domain of a Composition I4\" . he graphs of y = f(z) \ aluES of m. (g 0 fX-T) for various and y = 9(3:) are shown here. The diagram below illustrates the calculmn 0! Re - call. The symbol...

Problemi You are asked to design a Naive Bayes detector to detect drones using features captured from 3 sensors: Telemetry frequency band, VHF, UHF, SHF. FE (V.U.5) Telemetry signal power level: PE...

Order Form by table thead, tfoot{ font-weight: bold; background-color: #eee; } table { border-collapse: collapse; } table td, th { text-align: left; border: 1px solid #ddd; padding: 15px; } td:empty...

please show steps on what specifically needs to be done for this 4 B G H N 1 Function: ROUND: Formula: Add, Multiply. Divide: Cell Referencing 3 Using Excel to Cost Inventory Student Work Area...

Graded Lab 3: Recursion vs Iteration Objective: Evaluate the strengths and weaknesses of recursive algorithms in relation to the time taken to complete the program, and compare them to their...

The Fibonacci sequence is a well-known mathematical sequence in which each term is the sum of the two previous terms. The sequence can be defined as follows: fib(0) = 0 fib(1) = 1 fib(n) = fib(n-1) +...

Please help me out with this...I have ran the program on Python and get the result The result after I ran it completed for 3 hours here: time = 0.000021s, fib ( 1) = 1 time = 0.000008s, fib ( 2) = 1...

Find u(x,t) from the wave equation, where length of string is L=1, c = 1 and the initial velocity is zero and the initial deflection is as follows. :1/4 1/4 3/4 -1/44

Scotch can expand a successful manufacturing line for an immediate investment of $85 million. The company anticipates that the project will generate a cash flow of $172 million in 10 years (and only...

( Multiple Choice ) By the end of WWII, what was the tax rate on income over $ 2 0 0 , 0 0 0 ? ( Lecture ) Group of answer choices 5 4 % 6 4 % 9 4 %

2 FAKT RYEL VE B LME LEM 13 a b ve c do al say lard r 6 b a oldu una g re c nin alabilece i ka farkl de vard r A 5 B 6 C 7 D 8 E 9