Please troubleshoot the following mips code:

main:

# Call addNode

jal addNode

# The result $($value of the new node$)$ is now in $s$3$

j end # stop

# Inputs: $s$0=$ head, $s$2=$ n$,$ $s$1=$ newNode

# Output: $s$3=$ value of the inserted node

addNode:

addi $sp$,$ $sp$,-20$ # Allocate stack space $($including for error code$)$

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

sw $s$0,12($$sp$)$ # Save head

sw $s$2,8($$sp$)$ # Save n

sw $s$1,4($$sp$)$ # Save newNode

sw $zero, $0($$sp$)$ # Space for error code

beq $s$2,$ $zero, add$\_$at$\_$beginning # If n $==0,$ add at the beginning

jal findNode # Call findNode function

lw $v$1,0($$sp$)$ # Load error code

bne $v$1,$ $zero, addNode$\_$exit # If error code is not zero, exit

# Get the returned addresses from findNode

lw $t$0,4($$sp$)$ # Reload newNode

lw $t$3,0($$v$0)$ # Address of n$^$th node $($addr$1)$

lw $t$4,4($$v$0)$ # Address of $($n$+1)^$th node $($addr$2)$

# Insert newNode after addr$1$

sw $t$4,4($$t$0)$ # newNode$->$next $=$ addr$2$

sw $t$0,4($$t$3)$ # addr$1->$next $=$ newNode

lw $s$3,0($$t$0)$ # Store value of newNode in $s$3$

j addNode$\_$exit # Jump to exit

add$\_$at$\_$beginning:

lw $t$0,4($$sp$)$ # Reload newNode

lw $t$1,12($$sp$)$ # Reload head

sw $t$1,4($$t$0)$ # newNode$->$next $=$ head

move $s$0,$ $t$0$ # Update head to newNode

lw $s$3,0($$t$0)$ # Store value of newNode in $s$3$

j addNode$\_$exit # Jump to exit

addNode$\_$exit:

lw $ra$,16($$sp$)$ # Restore return address

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

jr $ra # Return

# Function: findNode

# Inputs: $s$0=$ head, $s$2=$ n

# Outputs: $v$0=$ addresses of n$^$th and $($n$+1)^$th nodes $($stored in memory$)$

findNode:

addi $sp$,$ $sp$,-20$ # Allocate more stack space for error code

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

sw $s$0,12($$sp$)$ # Save head

sw $s$2,8($$sp$)$ # Save n

sw $zero, $4($$sp$)$ # Initialize error code to $0($no error$)$

move $t$0,$ $s$0$ # curr $=$ head

move $t$1,$ $zero # i $=0$

findNode$\_$loop:

beq $t$1,$ $s$2,$ findNode$\_$end # If i $==$ n$,$ exit loop

beq $t$0,$ $zero, findNode$\_$error # If curr is NULL, list is too short

lw $t$0,4($$t$0)$ # curr $=$ curr$->$next

addi $t$1,$ $t$1,1$ # i$++$

j findNode$\_$loop

findNode$\_$error:

ori $v$1,$ $zero, $1$ # Set error code to $1($list too short$),$ equivalent to li $v$1,1$

j findNode$\_$cleanup # Jump to cleanup

findNode$\_$end:

sw $t$0,0($$sp$)$ # Store address of n$^$th node

lw $t$2,4($$t$0)$ # Get address of $($n$+1)^$th node

sw $t$2,4($$sp$)$ # Store address of $($n$+1)^$th node

move $v$0,$ $sp # Return address of stored addresses

findNode$\_$cleanup:

lw $ra$,16($$sp$)$ # Restore return address

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

jr $ra # Return

end:

Why are these values off?: