$.$data

input: $.$asciiz "Input: $"$

$.$text

$.$globl main

main:

# Prompt user for input

li $v$0,4$

la $a$0,$ input

syscall

# Get user input

li $v$0,5$

syscall

move $a$0,$ $v$0$

# Call Myfun$($N$)$

jal Myfun

# Print the result

li $v$0,1$

syscall

# Exit

li $v$0,10$

syscall

# Function to recursively calculate Myfun$($N$)$

Myfun:

# Save the return address and the argument $($$a$0)$ which contains N

addi $sp$,$ $sp$,-8$ # Allocate stack space for $2$ items

sw $ra$,4($$sp$)$ # Save return address

sw $a$0,0($$sp$)$ # Save argument N

# Base case: if N $<3,$ return $0$

slti $t$0,$ $a$0,3$ # Check if N $<3$

bne $t$0,$ $zero, base$\_$case # if N $<3,$ branch to end of function

# Recursive case: Myfun$($N$-2)+2$N

# Calculate N$-2$ and call Myfun recursively

addi $a$0,$ $a$0,-2$

jal Myfun

move $v$0,$ $v$0$

# After returning from recursive call, retrieve N and calculate $2$N

lw $t$1,0($$sp$)$ # Load original N

add $t$2,$ $t$1,$ $t$1$ # $t$1=2*$ N

# Add $2$N to the result of the recursive call

add $v$0,$ $v$0,$ $t$2$ # $v$0=$ $v$0+$ $t$2$

base$\_$case:

li $v$0,0$

j end$\_$myfun

end$\_$myfun:

# Retrieve the original return address and restore the stack

lw $ra$,4($$sp$)$ # Load the return address

addi $sp$,$ $sp$,8$ # Deallocate stack space

# Return to caller

jr $ra # Jump back to the return address

When I input any number less than $3$ it returns the input value, whenever I input $3$ it outputs $1$ instead of $0,$ when I input $4$ it outputs $2$ instead of $8$