i want to know whether my code is correct and also need to know whether the code is right?

$5$ points

$$ The fibonacci subroutine has a properly implemented general case $($F$($n$)=$ F$($n$-1)+$ F$($n$-2))$

$5$ points

$$ The fibonacci subroutine has properly implemented base cases $($F$(0)=0$ and F$(1)=1)$

$5$ points

$$ The first fibonacci subroutine call returns the correct output to main$()$ from n $=0$ to n $=9$

$5$ points

$$ The runtime stack is properly utilized and the total result of F$($n$)$ is stored in mains return value

location at x$5013$

$5$ points

$$ Your assembly program outputs the Fibonacci sequence number n correctly as formatted below:

Please enter a number n: $9$

F$(9)=34$

$5$ points

$$ Total

$30$ points

here it prompts for input after typing the input nothing happens

$.$ORIG x$3000$

; Prompt user for input

LEA R$0,$ PROMPT ; Load address of the prompt message

PUTS ; Display the prompt

GETC ; Read input character from user

OUT ; Output the character $($for confirmation$)$

ADD R$0,$ R$0,$ #$0$ ; Move character to R$0$

; Convert ASCII to integer

LD R$2,$ ASCII$\_$OFFSET ; Load the ASCII offset constant $(48)$

NOT R$2,$ R$2$ ; Compute $-48$

ADD R$2,$ R$2,$ #$1$ ; Complete $2\text{'}$s complement to get $-48$

ADD R$1,$ R$0,$ R$2$ ; Convert ASCII code to integer $($R$0-48)$

; Call Fibonacci subroutine

JSR FIBONACCI

; Store result in memory location x$5013$

LEA R$2,$ RESULT$\_$LOC

STR R$0,$ R$2,$ #$0$

; Display the result

LEA R$0,$ RESULT$\_$MSG ; Load address of result message

PUTS ; Display result message

; Convert result from integer to ASCII

ADD R$0,$ R$0,$ R$2$ ; Convert result from integer to ASCII $($R$0+48)$

OUT ; Output the result

HALT

FIBONACCI

ST R$7,$ SAVE$\_$R$7$ ; Save return address

ST R$1,$ SAVE$\_$R$1$ ; Save R$1($input value$)$

; Base case: if n $==0$

LD R$2,$ ZERO ; Load zero

ADD R$3,$ R$1,$ R$2$ ; Compare input with $0$

BRz BASE$\_$CASE$\_$ZERO

; Base case: if n $==1$

LD R$2,$ ONE ; Load one

ADD R$3,$ R$1,$ R$2$ ; Compare input with $1$

BRz BASE$\_$CASE$\_$ONE

; General case: F$($n$)=$ F$($n$-1)+$ F$($n$-2)$

ADD R$1,$ R$1,$ #$-1$ ; Compute n$-1$

JSR FIBONACCI ; Recursive call for F$($n$-1)$

ADD R$2,$ R$0,$ #$0$ ; Save result of F$($n$-1)$ in R$2$

LD R$1,$ SAVE$\_$R$1$ ; Restore original input value

ADD R$1,$ R$1,$ #$-2$ ; Compute n$-2$

JSR FIBONACCI ; Recursive call for F$($n$-2)$

ADD R$0,$ R$0,$ R$2$ ; Add results of F$($n$-1)$ and F$($n$-2)$

BRnzp RESTORE$\_$R$7$ ; Return from subroutine

BASE$\_$CASE$\_$ZERO

LD R$0,$ ZERO ; F$(0)=0$

BRnzp RESTORE$\_$R$7$ ; Return from subroutine

BASE$\_$CASE$\_$ONE

LD R$0,$ ONE ; F$(1)=1$

BRnzp RESTORE$\_$R$7$ ; Return from subroutine

RESTORE$\_$R$7$

LD R$7,$ SAVE$\_$R$7$ ; Load return address from stack

LD R$1,$ SAVE$\_$R$1$ ; Restore saved R$1$

RET ; Return from subroutine

; Data

PROMPT $.$STRINGZ "Please enter a number n: $"$ ; Prompt message

RESULT$\_$MSG $.$STRINGZ $"$F$($n$)="$ ; Result message

ASCII$\_$OFFSET $.$FILL #$48$ ; ASCII code for $\text{'}0\text{'}$

INPUT $.$BLKW #$1$ ; Storage for input

ZERO $.$FILL #$0$ ; Constant for base case $0$

ONE $.$FILL #$1$ ; Constant for base case $1$

SAVE$\_$R$7.$BLKW #$1$ ; Storage for saving R$7$

SAVE$\_$R$1.$BLKW #$1$ ; Storage for saving R$1$

RESULT$\_$LOC $.$FILL x$5013$ ; Address to store the result

$.$END