my code is failing the tests pictured, please help, tia!

Write a MIPS program to add a given node in a linked list at the specified location, using Nested Procedure Calls. If your code runs perfectly, but you didn't use Procedure Execution correctly, you will be given zero points.

Given Inputs:

the head of a linked list, i$.$e$,$ address of the start $($first node$)$ of the list

location: number of node in the linked list after which node is to be added $(0$ to add before the $1$st node, $1$ to add after $1$st node and so on$.)$

the address of the node to be inserted And each node contains:

an integer value

address to the next node $($address is NULL $(0)$ if it is the last node in the list$)$

Write the following three functions that will be called in order to update the linked list by adding the new node.

main

task: calls the addNode function and reads the value of the newly added node.

addNode

inputs: head of linked list $($head$),$ location to add node $($n$)$ and address of node to be added $($node$)$

task: calls the findNode function and add the node after the n$^$th node in the linked list. If the number is greater than the size of list, then add the node at the end of the list.

output: value of the inserted node.

findNode

inputs: head of linked list $(*$head$)$ and location to add node $($n$)$

task: navigate the linked list to find the addresses of the n$^$th and $($n$+1)^$th nodes

outputs: addresses of the n$^$th and $($n$+1)^$th nodes.

Registers Variables$1$:Compare storage

Drogram timed out

$2$:Compare storage

Program timed out

$3$:Compare storage

Program timed out

$4$:Compare storage

Program timed out

$s$0$ head

$s$1$ newNode

$s$2$ n

$s$3$ val

Linked List and New Node in Memory:

Addresses Contents

newNode newNode$->$value

head node$1->$value

head $+4$ node$1->$next

node$1->$next node$2->$value

node$1->$next $+4$ node$2->$next

node$2->$next node$3->$value

node$2->$next $+4$ node$3->$next

$......$

Example Test: If the values of $s$0$ through $s$3$ and Memory contents are initialized in the simulator as:

$($Use the $\text{'}+\text{'}$ button under the Registers display to initialize register values for $s$0,$ $s$1,$ $s$2$ and the $\text{'}+\text{'}$ button under the Memory display to initialize the initial array elements.$)$

Registers Data

$s$04000$

$s$18000$

$s$22$

$s$30$

Addresses Contents

$8000230$

$40004$

$40043848$

$3848-15$

$38526104$

$6104-10$

$61085008$

$50080$

$50124500$

$450040$

$45040$

The resultant registers are:

Registers Data

$s$04000$

$s$18000$

$s$22$

$s$3230$

The resultant array is:

Addresses Contents

$8000230$

$80046104$

$40004$

$40043848$

$3848-15$

$38528000$

$6104-10$

$61085008$

$50080$

$50124500$

$450040$

$45040$

# Enter your MIPS code below.

# Write short comments explaining each line of your code

# Explain your use of labels and functions

# Main function

main:

addi $a$0,$ $s$0,0$ # arg$1=$ head $=$ $s$0$

addi $a$1,$ $s$2,0$ # arg$2=$ n $=$ $s$2$

addi $a$2,$ $s$1,0$ # arg$3=$ node $=$ $s$1$

jal addNode # Call addNode function

Ret:

move $s$3,$ $v$0$ # $s$3=$ output of addNode function

j Exit # Exit the program

# Function to add a node at a specified location

addNode:

bne $a$1,$ $zero, C$\_$find # If n $!=0,$ call findNode logic

sw $a$0,4($$a$2)$ # newNode$->$next $=$ head

add $s$0,$ $a$2,$ $zero # head $=$ newNode

j R$\_$insert # return

C$\_$find:

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

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

Loop:

bge $t$1,$ $a$1,$ R$\_$find # if i $>=$ n$,$ return

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

beq $t$0,$ $zero, R$\_$find # if curr $==$ NULL, break

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

j Loop

R$\_$find:

move $v$0,$ $t$0$ # v$0=$ address of n$-$th node

lw $v$1,4($$t$0)$ # v$1=$ address of $($n$+1)-$th node

sw $a$2,4($$v$0)$ # n$-$th node's next $=$ newNode

sw $v$1,4($$a$2)$ # newNode's next $=($n$+1)-$th node

j R$\_$insert # return

R$\_$insert:

lw $v$0,0($$a$2)$ # Return newNode$->$value

j Loop # Loop indefinitely

Exit:

j Exit # Infinite loop to halt program execution