Hello, I would like a second opinion on this please. Finished it but I'm skeptical. Thank you. MIPS Assemble language

Consider a linked list data structure in which each node is implemented with two consecutive words of memory. The first word of each node contains an integer value. The second word contains the memory address of (the first word of) the next node in the list. A memory address value of zero indicates the end of the list. The address of the first node of the list is stored in a memory word with label head. Give a sequence of MIPS assembly language instructions that removes (unlinks) the second node from the list. (You may assume that the list has at least two nodes.)

Suppose that A and B are defined using A: .word 0, and B: .space 100. Give a sequence of MIPS assembly language instructions that calls a procedure P with its two arguments being the contents of A and the address of B, using the standard procedure call conventions, and then stores the return value from P into A. (You do not need to show any code for the procedure P.)