MIPS ASSEMBLY LINKED LIST

Context:

In memory, the linked lists your utilities will work with are implemented as follows: each element consists of 2 parts: pointerToNext, and value. Each part is a 32-bit MIPS word in memory. The two parts are located in successive word addresses, with the pointerToNext being first. For example, if the byte address of the pointerToNext is 100, then the byte address of the value will be 104. Remember, MIPS memory is byte addressable. In the last element of the linked list, the pointerToNext has value 0, in other words it is the null pointer.This means that there is not any next element. But of course the last element still has a value.

Q) Write a utility program named as create_list that creates the contents of a linked list, element by element. It will first ask the user to enter the number of elements in the linked list (It will accept non-negative integer values: 0, 1, 2, etc). Assume that I have the main program that calls this utility function.